1381 search results - page 95 / 277 » Computational Complexity of Constraint Satisfaction |
149
click to vote
AIR
2004
15 years 4 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
123
click to vote
MICCAI
2005
Springer
16 years 5 months ago
2005
Springer
We address the problem of the stitching task in endoscopic surgery using a circular needle under robotic assistance. Our main focus is to present an algorithm for suturing using gu...
109
click to vote
ICTAI
2008
IEEE
15 years 10 months ago
2008
IEEE
Control architectures, such as the LAAS architecture [1], CLARATY [12] and HARPIC [9], have been developped to provide autonomy to robots. To achieve a robot’s task, these contr...
111
Voted
ORL
2008
15 years 4 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
156
click to vote
CP
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...