Sciweavers

664 search results - page 32 / 133
» The tree Constraint
Sort
View
LICS
2002
IEEE
14 years 1 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
CP
1998
Springer
14 years 29 days ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 7 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
EWSA
2004
Springer
14 years 2 months ago
Constraints of Behavioural Inheritance
We present an approach to component inheritance and reuse which closes the gap between architectural design and process-oriented approaches. To apply inheritance checks in design a...
Ella E. Roubtsova, Serguei A. Roubtsov
CP
2009
Springer
14 years 9 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey