112 search results - page 4 / 23 » Using CBR to Select Solution Strategies in Constraint Progra... |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
CP
2009
Springer
14 years 10 months ago
2009
Springer
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 ...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— In this paper, we consider the task of repositioning a formation of robots to a new shape while minimizing either the maximum distance that any robot travels, or the to...
ICIP
2003
IEEE
14 years 11 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
RTA
1995
Springer
14 years 1 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...