6437 search results - page 216 / 1288 » Parallel Algorithms for Arrangements |
121
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we examine several localization algorithms and evaluate their robustness to attacks where an adversary attenuates or amplifies the signal strength at one or more lan...
102
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Developing algorithms for sensor networks—and proving their correctness and performance—, requires simplifying but still realistic models. This paper surveys various models in...
203
click to vote
DAPSYS
2004
Springer
15 years 8 months ago
2004
Springer
The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithm...
123
Voted
PPSN
2004
Springer
15 years 8 months ago
2004
Springer
Formula One motor racing is a rich sport that spends millions on research and development of highly optimized cars. Here we describe the use of a genetic algorithm to optimize 66 s...
PODC
1987
ACM
15 years 6 months ago
1987
ACM
Abstract: We introduce the input-output automaton, a simple but powerful model of computation in asynchronous distributed networks. With this model we are able to construct modular...