Experimental Efficient Algorithms Third (8 results)

- Softcover
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
Contact seller5-star sellerCondition: Used - Very good
US$ 43.69
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 68.17
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.

- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 80.62
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 77.09
US$ 15.10 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.

- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 76.36
US$ 20.07 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.

- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 77.05
US$ 20.07 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.

- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 76.72
US$ 39.26 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …
More images- Softcover
- Print on Demand
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 58.06
US$ 78.52 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Experimental and Efficient Algorithms | Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings | Celso C. Ribeiro (u. a.) | Taschenbuch | x | Englisch | 2004 | Springer | EAN 9783540220671 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …