248 search results - page 13 / 50 » The Multi-Story Space Assignment Problem |
DAWAK
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
ICCCN
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract—CAN is a well-known DHT technique for contentbased P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed i...
AIPS
2006
13 years 11 months ago
2006
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
AAAI
1997
13 years 11 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
JAIR
2007
13 years 9 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...