| 000 | 05446nam a22006375i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-24838-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125650.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2004 gw | s |||| 0|eng d | ||
| 020 |
_a9783540248385 _9978-3-540-24838-5 |
||
| 024 | 7 |
_a10.1007/b97914 _2doi |
|
| 050 | 4 | _aT57-57.97 | |
| 072 | 7 |
_aPBW _2bicssc |
|
| 072 | 7 |
_aMAT003000 _2bisacsh |
|
| 072 | 7 |
_aPBW _2thema |
|
| 082 | 0 | 4 |
_a519 _223 |
| 245 | 1 | 0 |
_aExperimental and Efficient Algorithms _h[electronic resource] : _bThird International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings / _cedited by Celso C. Ribeiro, Simone L. Martins. |
| 250 | _a1st ed. 2004. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
| 300 |
_aX, 590 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3059 |
|
| 505 | 0 | _aA 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 UnrankingAlgorithms -- 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. | |
| 650 | 0 | _aMathematics. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 |
_aArtificial intelligence _xData processing. |
|
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aNumerical analysis. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aApplications of Mathematics. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aData Science. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aNumerical Analysis. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 700 | 1 |
_aRibeiro, Celso C. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aMartins, Simone L. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540220671 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662178577 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3059 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/b97914 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c180417 _d180417 |
||