728 search results - page 30 / 146 » Efficient Searching with Linear Constraints |
146
click to vote
IJCAI
2003
15 years 7 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
176
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
155
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
159
click to vote
IROS
2008
IEEE
16 years 13 days ago
2008
IEEE
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...