1453 search results - page 128 / 291 » Partial Constraint Satisfaction |
178
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
117
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
119
click to vote
ASPDAC
1999
ACM
15 years 8 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
113
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
152
click to vote
SPLC
2010
15 years 2 months ago
2010
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...