Sciweavers

657 search results - page 3 / 132
» A Version Numbering Scheme with a Useful Lexicographical Ord...
Sort
View
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 7 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
ECAI
2006
Springer
13 years 10 months ago
Symmetry Breaking Using Value Precedence
We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints th...
Toby Walsh
JSCIC
2008
47views more  JSCIC 2008»
13 years 6 months ago
Positive Scheme Numerical Simulation of High Mach Number Astrophysical Jets
High Mach number astrophysical jets are simulated using a positive scheme, and are compared with WENO-LF simulations. A version of the positive scheme has allowed us to simulate as...
Youngsoo Ha, Carl L. Gardner
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
13 years 11 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EOR
2007
117views more  EOR 2007»
13 years 6 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...