1381 search results - page 79 / 277 » Computational Complexity of Constraint Satisfaction |
130
click to vote
CBSE
2009
Springer
15 years 10 months ago
2009
Springer
To build highly available or reliable applications out of unreliable third-party components, some software-implemented fault-tolerant mechanisms are introduced to gracefully deal w...
136
Voted
AAAI
2004
15 years 5 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
199
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
103
click to vote
CHI
2003
ACM
16 years 4 months ago
2003
ACM
Calendar applications for small handheld devices such as PDAs are growing in popularity. This led us to develop FishCal, a novel calendar interface for PDAs. It supports users in ...
133
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— We present a novel algorithm for motion planning of a deformable robot in a static environment. Given the initial and final configuration of the robot, our algorithm ...