Sciweavers

157 search results - page 3 / 32
» SLIDE: A Useful Special Case of the CARDPATH Constraint
Sort
View
CP
2001
Springer
13 years 9 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
BIRTHDAY
2005
Springer
13 years 11 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran
ICRA
2009
IEEE
130views Robotics» more  ICRA 2009»
13 years 12 months ago
Mechanics of bending, torsion, and variable precurvature in multi-tube active cannulas
— Active cannulas are a relatively new continuum robot subclass characterized by their use of preshaped tubes that transmit bending moments as they slide within one another and a...
D. Caleb Rucker, Robert J. Webster
COMPULOG
1999
Springer
13 years 9 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
CP
2004
Springer
13 years 10 months ago
The Cardinality Matrix Constraint
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
Jean-Charles Régin, Carla P. Gomes