3172 search results - page 445 / 635 » On the Random-Self-Reducibility of Complete Sets |
206
click to vote
WADS
2007
Springer
16 years 21 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
138
click to vote
CGO
2006
IEEE
16 years 19 days ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
160
click to vote
ICRA
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we consider the problem of exploring an unknown environment with a team of mobile robots. One of the key issues in multi-robot exploration is how to assign targe...
163
click to vote
INFOCOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— The limited number of orthogonal channels and the autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSS’s) op...
190
click to vote
LICS
2006
IEEE
16 years 18 days ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...