6456 search results - page 333 / 1292 » Constraint Solving on Terms |
186
Voted
CPAIOR
2007
Springer
16 years 26 days ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
156
Voted
CPAIOR
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
184
click to vote
STAIRS
2008
15 years 8 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
164
click to vote
COR
2010
15 years 6 months ago
2010
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
186
click to vote
JVCA
2007
15 years 6 months ago
2007
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...