1381 search results - page 109 / 277 » Computational Complexity of Constraint Satisfaction |
127
click to vote
WLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
122
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
124
click to vote
JAIR
2010
15 years 2 months ago
2010
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
244
click to vote
AGP
2010
IEEE
15 years 9 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
116
click to vote
JMIV
2006
15 years 4 months ago
2006
Studying large deformations with a Riemannian approach has been an efficient point of view to generate metrics between deformable objects, and to provide accurate, non ambiguous an...