1264 search results - page 33 / 253 » The framework approach for constraint satisfaction |
IROS
2009
IEEE
15 years 8 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...
170
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
IFM
2009
Springer
15 years 8 months ago
2009
Springer
In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to e...
122
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract - Streaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constrai...
104
click to vote
IRI
2006
IEEE
15 years 8 months ago
2006
IEEE
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...