3367 search results - page 159 / 674 » Incremental assignment problem |
134
Voted
CHI
2011
ACM
14 years 6 months ago
2011
ACM
We developed DataBoard, a freeform spatial interface, to support users in simple problem solving tasks. To develop a deeper understanding of the role of space and the tradeoffs be...
120
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
118
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
142
click to vote
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
— The bootstrap problem is often recognized as one of the main challenges of evolutionary robotics: if all individuals from the first randomly generated population perform equal...
132
click to vote
ESA
1997
Springer
15 years 7 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...