Coverart for item
The Resource 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.)

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.)

Label
Experimental and efficient algorithms : third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004 : proceedings
Title
Experimental and efficient algorithms
Title remainder
third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004 : proceedings
Statement of responsibility
Celso C. Ribeiro, Simone L. Martins (eds.)
Title variation
WEA 2004
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc
Member of
Cataloging source
N$T
Dewey number
005.1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
W43 2004eb
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2004
http://bibfra.me/vocab/lite/meetingName
WEA (Workshop)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Ribeiro, Celso C
  • Martins, Simone L
  • European Association for Theoretical Computer Science
Series statement
Lecture notes in computer science,
Series volume
3059
http://library.link/vocab/subjectName
  • Computer algorithms
  • Algorithmes
  • COMPUTERS
  • COMPUTERS
  • COMPUTERS
  • Computer algorithms
  • Algorithmische Geometrie
  • Algorithmus
  • Berechnungskomplexität
  • Effizienter Algorithmus
  • Kombinatorische Optimierung
  • Stochastischer Prozess
  • Algorithme
  • Graph
  • Angra dos Reis (2004)
Label
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.)
Instantiates
Publication
Note
"Sponsored by the European Association for Theoretical Computer Science (EATCS)"--Preface
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
60766684
Dimensions
unknown
Extent
1 online resource (x, 586 pages)
File format
unknown
Form of item
online
Isbn
9783540248385
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)60766684
Label
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.)
Publication
Note
"Sponsored by the European Association for Theoretical Computer Science (EATCS)"--Preface
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
60766684
Dimensions
unknown
Extent
1 online resource (x, 586 pages)
File format
unknown
Form of item
online
Isbn
9783540248385
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)60766684

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...