Sciweavers

3318 search results - page 173 / 664
» The Weak Instance Model
Sort
View
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
EPIA
1999
Springer
14 years 15 days ago
Combinatorial Optimization in OPL Studio
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
Pascal Van Hentenryck, Laurent Michel, Philippe La...
ATVA
2007
Springer
150views Hardware» more  ATVA 2007»
14 years 7 days ago
3-Valued Circuit SAT for STE with Automatic Refinement
Abstract. Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X n"), where t...
Orna Grumberg, Assaf Schuster, Avi Yadgar
DAGSTUHL
1997
13 years 9 months ago
Fast and Accurate Collision Detection for Virtual Environments
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
Ming C. Lin
ATAL
2007
Springer
14 years 2 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker