74 search results - page 13 / 15 » Smallest Color-Spanning Objects |
AAAI
2008
13 years 9 months ago
2008
Sequential single-item auctions can be used for the distributed allocation of tasks to cooperating agents. We study how to improve the team performance of sequential singleitem au...
CCCG
2003
13 years 8 months ago
2003
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
OODBS
2000
13 years 11 months ago
2000
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...