1 option
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.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 3059.
- Lecture Notes in Computer Science, 0302-9743 ; 3059
- Language:
- English
- Subjects (All):
- Applied mathematics.
- Engineering mathematics.
- Algorithms.
- Data structures (Computer science).
- Computer science--Mathematics.
- Computer science.
- Numerical analysis.
- Artificial intelligence.
- Applications of Mathematics.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Artificial Intelligence.
- Local Subjects:
- Applications of Mathematics.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Numeric Computing.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (X, 590 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-24838-5
- 9783540248385
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.