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.
Experimental and Efficient Algorithms [[electronic resource] ] : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings / / edited by Celso C. Ribeiro, Simone L. Martins
| Experimental and Efficient Algorithms [[electronic resource] ] : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings / / edited by Celso C. Ribeiro, Simone L. Martins |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 590 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Applied mathematics
Engineering mathematics Algorithms Data structures (Computer science) Computer science—Mathematics Numerical analysis Artificial intelligence Applications of Mathematics Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Numeric Computing Artificial Intelligence |
| ISBN |
1-280-30767-6
9786610307678 3-540-24838-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling -- Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases -- Solving Chance-Constrained Programs Combining Tabu Search and Simulation -- An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation -- On an Experimental Algorithm for Revenue Management for Cargo Airlines -- Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem -- Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s -- A Randomized Heuristic for Scene Recognition by Graph Matching -- An Efficient Implementation of a Joint Generation Algorithm -- Lempel, Even, and Cederbaum Planarity Method -- A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique -- Distributed Circle Formation for Anonymous Oblivious Robots -- Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems -- Engineering Shortest Path Algorithms -- How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas -- Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem -- Fingered Multidimensional Search Trees -- Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem -- Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm -- Combining Speed-Up Techniques for Shortest-Path Computations -- Increased Bit-Parallelism for Approximate String Matching -- The Role of Experimental Algorithms in Genomics -- A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets -- Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem -- An Experimental Study of Unranking Algorithms -- An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem -- GRASP with Path-Relinking for the Quadratic Assignment Problem -- Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks -- A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs -- Approximating Interval Coloring and Max-Coloring in Chordal Graphs -- A Statistical Approach for Algorithm Selection -- An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization -- A Huffman-Based Error Detecting Code -- Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs -- An Efficient Tabu Search Heuristic for the School Timetabling Problem -- Experimental Studies of Symbolic Shortest-Path Algorithms -- Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem -- Using Compact Tries for Cache-Efficient Sorting of Integers -- Using Random Sampling to Build Approximate Tries for Efficient String Sorting -- The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation -- An Analytical Model for Energy Minimization -- A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. |
| Record Nr. | UNISA-996466233603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Experimental and Efficient Algorithms : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings / / edited by Celso C. Ribeiro, Simone L. Martins
| Experimental and Efficient Algorithms : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings / / edited by Celso C. Ribeiro, Simone L. Martins |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (X, 590 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Applied mathematics
Engineering mathematics Algorithms Data structures (Computer science) Computer science—Mathematics Numerical analysis Artificial intelligence Applications of Mathematics Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Numeric Computing Artificial Intelligence |
| ISBN |
1-280-30767-6
9786610307678 3-540-24838-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling -- Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases -- Solving Chance-Constrained Programs Combining Tabu Search and Simulation -- An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation -- On an Experimental Algorithm for Revenue Management for Cargo Airlines -- Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem -- Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s -- A Randomized Heuristic for Scene Recognition by Graph Matching -- An Efficient Implementation of a Joint Generation Algorithm -- Lempel, Even, and Cederbaum Planarity Method -- A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique -- Distributed Circle Formation for Anonymous Oblivious Robots -- Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems -- Engineering Shortest Path Algorithms -- How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas -- Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem -- Fingered Multidimensional Search Trees -- Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem -- Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm -- Combining Speed-Up Techniques for Shortest-Path Computations -- Increased Bit-Parallelism for Approximate String Matching -- The Role of Experimental Algorithms in Genomics -- A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets -- Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem -- An Experimental Study of Unranking Algorithms -- An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem -- GRASP with Path-Relinking for the Quadratic Assignment Problem -- Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks -- A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs -- Approximating Interval Coloring and Max-Coloring in Chordal Graphs -- A Statistical Approach for Algorithm Selection -- An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization -- A Huffman-Based Error Detecting Code -- Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs -- An Efficient Tabu Search Heuristic for the School Timetabling Problem -- Experimental Studies of Symbolic Shortest-Path Algorithms -- Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem -- Using Compact Tries for Cache-Efficient Sorting of Integers -- Using Random Sampling to Build Approximate Tries for Efficient String Sorting -- The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation -- An Analytical Model for Energy Minimization -- A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. |
| Record Nr. | UNINA-9910767531403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Optimization by GRASP : Greedy Randomized Adaptive Search Procedures / / by Mauricio G.C. Resende, Celso C. Ribeiro
| Optimization by GRASP : Greedy Randomized Adaptive Search Procedures / / by Mauricio G.C. Resende, Celso C. Ribeiro |
| Autore | Resende Mauricio G.C |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | New York, NY : , : Springer New York : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XX, 312 p. 173 illus., 117 illus. in color.) |
| Disciplina | 519.3 |
| Soggetto topico |
Computer mathematics
Computer science—Mathematics Operations research Decision making Industrial engineering Production engineering Artificial intelligence Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Operations Research/Decision Theory Industrial and Production Engineering Artificial Intelligence |
| ISBN | 1-4939-6530-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Foreword -- Preface -- 1. Introduction -- 2. A short tour of combinatorial optimization and computational complexity -- 3. Solution construction and greedy algorithms -- 4. Local search -- 5. GRASP: The basic heuristic -- 6. Runtime distributions -- 7. GRASP: extended construction heuristics -- 8. Path-relinking -- 9. GRASP with Path-relinking -- 10. Parallel GRASP heuristics -- 11. GRASP for continuous optimization -- 12. Case studies -- References -- Index. |
| Record Nr. | UNINA-9910254092003321 |
Resende Mauricio G.C
|
||
| New York, NY : , : Springer New York : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||