143 search results - page 26 / 29 » ijcai 2001 |
IJCAI
2001
14 years 11 months ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...
IJCAI
2001
14 years 11 months ago
2001
This paper presents a new method for building domain-specific web search engines. Previous methods eliminate irrelevant documents from the pages accessed using heuristics based on...
59
Voted
IJCAI
2001
14 years 11 months ago
2001
Generalized Vickrey mechanisms have received wide attention in the literature because they are efficient and strategyproof, i.e. truthful bidding is optimal whatever the bids of o...
70
Voted
IJCAI
2001
14 years 11 months ago
2001
Many mobile robot tasks can be most efficiently solved when a group of robots is utilized. The type of organization, and the level of coordination and communication within a team ...
IJCAI
2001
14 years 11 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...