248 search results - page 13 / 50 » The Multi-Story Space Assignment Problem |
239
click to vote
DAWAK
2005
Springer
15 years 8 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...
100
click to vote
ICCCN
2008
IEEE
15 years 9 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...
101
Voted
AIPS
2006
15 years 3 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...
123
click to vote
AAAI
1997
15 years 3 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
116
click to vote
JAIR
2007
15 years 2 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 ...