13621 search results - page 2656 / 2725 » Computability and Complexity in Self-assembly |
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
116
Voted
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
101
click to vote
COMPGEOM
2008
ACM
15 years 26 days ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
104
click to vote
CPAIOR
2008
Springer
15 years 26 days ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
110
click to vote
CSCLP
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...