Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Applications in Management [[electronic resource] ] : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings / / edited by Nimrod Megiddo, Yinfeng Xu, Nancy Alonstioti, Binhai Zhu
| Algorithmic Applications in Management [[electronic resource] ] : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings / / edited by Nimrod Megiddo, Yinfeng Xu, Nancy Alonstioti, Binhai Zhu |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 484 p.) |
| Disciplina | 005.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer programming
Leadership Computers Algorithms Data structures (Computer science) Computer science—Mathematics Programming Techniques Business Strategy/Leadership Theory of Computation Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition -- Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions -- Contributed Papers -- Complexity of Minimal Tree Routing and Coloring -- Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks -- An Algorithm for Nonconvex Lower Semicontinuous Optimization Problems -- A Risk-Reward Competitive Analysis of the Bahncard Problem -- Competitive Strategies for On-line Production Order Disposal Problem -- Automatic Timetabling Using Artificial Immune System -- Improved Algorithms for Two Single Machine Scheduling Problems -- N-Person Noncooperative Game with Infinite Strategic Space -- On the Online Dial-A-Ride Problem with Time-Windows -- Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling -- Coopetitive Game, Equilibrium and Their Applications -- An Equilibrium Model in Urban Transit Riding and Fare Polices -- Optimal Timing of Firms’ R&D Investment Under Asymmetric Duopoly: A Real Options and Game-Theoretic Approach -- Improvement of Genetic Algorithm and Its Application in Optimization of Fuzzy Traffic Control Algorithm -- Facility Location in a Global View -- Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population -- A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals -- Linear Time Algorithms for Parallel Machine Scheduling -- A New Method for Retrieval Based on Relative Entropy with Smoothing -- Airplane Boarding, Disk Scheduling and Space-Time Geometry -- Portfolio Selection: Possibilistic Mean-Variance Model and Possibilistic Efficient Frontier -- Design DiffServ Multicast with Selfish Agents -- Competitive Analysis of On-line Securities Investment -- Perfectness and Imperfectness of the kth Power of Lattice Graphs -- An Approximation Algorithm for Weak Vertex Cover Problem in Network Management -- Constructing Correlations in Attack Connection Chains Using Active Perturbation -- Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions -- Computation of Arbitrage in a Financial Market with Various Types of Frictions -- Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length -- Efficiently Pricing European-Asian Options — Ultimate Implementation and Analysis of the AMO Algorithm -- An Incremental Approach to Link Evaluation in Topic-Driven Web Resource Discovery -- A Continuous Method for Solving Multiuser Detection in CDMA -- Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks -- An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands -- Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms -- Optimal Manpower Planning with Temporal Labor and Contract Period Constraints -- Mechanism Design for Set Cover Games When Elements Are Agents -- Graph Bandwidth of Weighted Caterpillars -- An Algorithm for Portfolio’s Value at Risk Based on Principal Factor Analysis -- An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring -- On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4] -- Assign Ranges in General Ad-Hoc Networks -- Inverse Problems of Some NP-Complete Problems -- Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs -- A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint -- Point Sets and Frame Algorithms in Management -- Mining a Class of Complex Episodes in Event Sequences -- Locating Performance Monitoring Mobile Agents in Scalable Active Networks. |
| Record Nr. | UNISA-996466129603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications [[electronic resource] ] : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 432 p. 94 illus.) |
| Disciplina | 005.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-03780-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial optimization and its applications -- Theoretical results -- Experimental and applied research of general algorithmic interest. |
| Record Nr. | UNISA-996465558303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 432 p. 94 illus.) |
| Disciplina | 005.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-03780-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial optimization and its applications -- Theoretical results -- Experimental and applied research of general algorithmic interest. |
| Record Nr. | UNINA-9910483897103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings / / edited by Tandy Warnow, Binhai Zhu
| Computing and Combinatorics [[electronic resource] ] : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings / / edited by Tandy Warnow, Binhai Zhu |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XIV, 566 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer communication systems Data structures (Computer science) Computer science—Mathematics Computer graphics Algorithm Analysis and Problem Complexity Science, Humanities and Social Sciences, multidisciplinary Computer Communication Networks Data Structures Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45071-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- LIAR! -- Experiments for Algorithm Engineering -- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers -- Computational Geometry I -- Cylindrical Hierarchy for Deforming Necklaces -- Geometric Algorithms for Agglomerative Hierarchical Clustering -- Traveling Salesman Problem of Segments -- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs -- Computational Biology I -- A Space Efficient Algorithm for Sequence Alignment with Inversions -- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison -- On All-Substrings Alignment Problems -- Computational/Complexity Theory I -- The Specker-Blatter Theorem Revisited -- On the Divergence Bounded Computable Real Numbers -- Sparse Parity-Check Matrices over Finite Fields -- Graph Theory/Algorithms I -- On the Full and Bottleneck Full Steiner Tree Problems -- The Structure and Number of Global Roundings of a Graph -- On Even Triangulations of 2-Connected Embedded Graphs -- Automata/Petri Net Theory -- Petri Nets with Simple Circuits -- Automatic Verification of Multi-queue Discrete Timed Automata -- Graph Theory/Algorithms II -- List Total Colorings of Series-Parallel Graphs -- Finding Hidden Independent Sets in Interval Graphs -- Matroid Representation of Clique Complexes -- Complexity Theory II -- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results -- The Complexity of Boolean Matrix Root Computation -- A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions -- Distributed Computing -- Group Mutual Exclusion Algorithms Based on Ticket Orders -- Distributed Algorithm for Better Approximation of the Maximum Matching -- Efficient Mappings for Parity-Declustered Data Layouts -- Web-Based Computing -- Approximate Rank Aggregation -- Perturbation of the Hyper-Linked Environment -- Fast Construction of Generalized Suffix Trees over a Very Large Alphabet -- Complexity Theory III -- Complexity Theoretic Aspects of Some Cryptographic Functions -- Quantum Sampling for Balanced Allocations -- Graph Theory/Algorithms III -- Fault-Hamiltonicity of Product Graph of Path and Cycle -- How to Obtain the Complete List of Caterpillars -- Randomized Approximation of the Stable Marriage Problem -- Computational Geometry II -- Tetris is Hard, Even to Approximate -- Approximate MST for UDG Locally -- Efficient Construction of Low Weight Bounded Degree Planar Spanner -- Graph Theory/Algorithms IV -- Isoperimetric Inequalities and the Width Parameters of Graphs -- Graph Coloring and the Immersion Order -- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs -- Scheduling -- Scheduling Broadcasts with Deadlines -- Improved Competitive Algorithms for Online Scheduling with Partial Job Values -- Majority Equilibrium for Public Facility Allocation -- Computational Geometry III -- On Constrained Minimum Pseudotriangulations -- Pairwise Data Clustering and Applications -- Covering a Set of Points with a Minimum Number of Turns -- Graph Drawing -- Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees -- Bounds for Convex Crossing Numbers -- On Spectral Graph Drawing -- Computational Biology II -- On a Conjecture on Wiener Indices in Combinatorial Chemistry -- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data -- Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences -- Genomic Distances under Deletions and Insertions -- Fixed-Parameter Complexity Theory -- Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. |
| Record Nr. | UNISA-996466061403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings / / edited by Tandy Warnow, Binhai Zhu
| Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings / / edited by Tandy Warnow, Binhai Zhu |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XIV, 566 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computer communication systems Data structures (Computer science) Computer science—Mathematics Computer graphics Algorithm Analysis and Problem Complexity Science, Humanities and Social Sciences, multidisciplinary Computer Communication Networks Data Structures Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-45071-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- LIAR! -- Experiments for Algorithm Engineering -- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers -- Computational Geometry I -- Cylindrical Hierarchy for Deforming Necklaces -- Geometric Algorithms for Agglomerative Hierarchical Clustering -- Traveling Salesman Problem of Segments -- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs -- Computational Biology I -- A Space Efficient Algorithm for Sequence Alignment with Inversions -- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison -- On All-Substrings Alignment Problems -- Computational/Complexity Theory I -- The Specker-Blatter Theorem Revisited -- On the Divergence Bounded Computable Real Numbers -- Sparse Parity-Check Matrices over Finite Fields -- Graph Theory/Algorithms I -- On the Full and Bottleneck Full Steiner Tree Problems -- The Structure and Number of Global Roundings of a Graph -- On Even Triangulations of 2-Connected Embedded Graphs -- Automata/Petri Net Theory -- Petri Nets with Simple Circuits -- Automatic Verification of Multi-queue Discrete Timed Automata -- Graph Theory/Algorithms II -- List Total Colorings of Series-Parallel Graphs -- Finding Hidden Independent Sets in Interval Graphs -- Matroid Representation of Clique Complexes -- Complexity Theory II -- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results -- The Complexity of Boolean Matrix Root Computation -- A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions -- Distributed Computing -- Group Mutual Exclusion Algorithms Based on Ticket Orders -- Distributed Algorithm for Better Approximation of the Maximum Matching -- Efficient Mappings for Parity-Declustered Data Layouts -- Web-Based Computing -- Approximate Rank Aggregation -- Perturbation of the Hyper-Linked Environment -- Fast Construction of Generalized Suffix Trees over a Very Large Alphabet -- Complexity Theory III -- Complexity Theoretic Aspects of Some Cryptographic Functions -- Quantum Sampling for Balanced Allocations -- Graph Theory/Algorithms III -- Fault-Hamiltonicity of Product Graph of Path and Cycle -- How to Obtain the Complete List of Caterpillars -- Randomized Approximation of the Stable Marriage Problem -- Computational Geometry II -- Tetris is Hard, Even to Approximate -- Approximate MST for UDG Locally -- Efficient Construction of Low Weight Bounded Degree Planar Spanner -- Graph Theory/Algorithms IV -- Isoperimetric Inequalities and the Width Parameters of Graphs -- Graph Coloring and the Immersion Order -- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs -- Scheduling -- Scheduling Broadcasts with Deadlines -- Improved Competitive Algorithms for Online Scheduling with Partial Job Values -- Majority Equilibrium for Public Facility Allocation -- Computational Geometry III -- On Constrained Minimum Pseudotriangulations -- Pairwise Data Clustering and Applications -- Covering a Set of Points with a Minimum Number of Turns -- Graph Drawing -- Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees -- Bounds for Convex Crossing Numbers -- On Spectral Graph Drawing -- Computational Biology II -- On a Conjecture on Wiener Indices in Combinatorial Chemistry -- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data -- Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences -- Genomic Distances under Deletions and Insertions -- Fixed-Parameter Complexity Theory -- Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. |
| Record Nr. | UNINA-9910143857303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu
| Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 364 p. 97 illus.) : digital |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
| ISBN | 3-642-38756-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466301103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu
| Frontiers in Algorithmics and Algorithmic Aspects in Information and Management : Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings / / edited by Michael Fellows, Xuehou Tan, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 364 p. 97 illus.) : digital |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
| ISBN | 3-642-38756-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483316203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings / / edited by Mikhail Atallah, Xiang-Yang Li, Binhai Zhu
| Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings / / edited by Mikhail Atallah, Xiang-Yang Li, Binhai Zhu |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 390 p. 85 illus., 20 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
| ISBN | 3-642-21204-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465637903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||