1483 search results - page 110 / 297 » Geometric constraint satisfaction using optimization methods |
116
click to vote
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
112
click to vote
CPAIOR
2007
Springer
15 years 7 months 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...
157
click to vote
CIMCA
2006
IEEE
15 years 7 months ago
2006
IEEE
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...
114
click to vote
AAAI
2010
15 years 2 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
TSMC
1998
15 years 1 months ago
1998
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...