Experimental and Efficient Algorithms : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004. Proceedings
Enregistré dans:
| Auteur principal: | |
|---|---|
| Collectivité auteur: | |
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
3059 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Experimental and efficient algorithms, Third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, proceedings, Celso C. Ribeiro, Simone L. Martins (eds.), Berlin, Springer, 2004, 1 vol. (X-586 p.), Lecture notes in computer science, 3-540-22067-4 • Experimental and Efficient Algorithms, Texte imprimé, 9783662178577 |
| LEADER | 05560nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 972281 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155221485 | ||
| 020 | |a 9783540248385 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 100 | 1 | |a Ribeiro, Celso C. | |
| 245 | 1 | 0 | |a Experimental and Efficient Algorithms : |b Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004. Proceedings |c edited by Celso C. Ribeiro, Simone L. Martins. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 3059 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Intelligence artificielle | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Martins, Simone L. |4 pbd | |
| 711 | 2 | |a WEA 2004 |n (3 |d :2004 |c :Angra dos Reis, BR). |4 aut | |
| 776 | 0 | |0 079261272 |t Experimental and efficient algorithms |o Third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004 |o proceedings |f Celso C. Ribeiro, Simone L. Martins (eds.) |c Berlin |n Springer |d 2004 |p 1 vol. (X-586 p.) |s Lecture notes in computer science |z 3-540-22067-4 | |
| 776 | 0 | |t Experimental and Efficient Algorithms |b Texte imprimé |z 9783662178577 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/b97914 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-K5GSCH4H-0 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750643277 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b97914 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753994399 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b97914 |z Accès INSA CVL | |
| 997 | |0 972281 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||