660 search results - page 62 / 132 » Hybrid CSP Solving |
117
Voted
AIPS
2008
15 years 6 months ago
2008
When controlling an autonomous system, it is inefficient or sometimes impossible for the human operator to specify detailed commands. Instead, the field of AI autonomy has develop...
178
Voted
KI
2010
Springer
14 years 10 months ago
2010
Springer
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
158
Voted
JSAT
2006
15 years 3 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
128
Voted
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
135
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The pro...