6105 search results - page 215 / 1221 » A Parallel Algorithm for Bound-Smoothing |
143
Voted
IPPS
2006
IEEE
16 years 13 days 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...
243
click to vote
DAPSYS
2004
Springer
15 years 11 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...
164
click to vote
PPSN
2004
Springer
15 years 11 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...
95
Voted
PODC
1987
ACM
15 years 10 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...
156
click to vote
EUROPAR
2008
Springer
15 years 8 months ago
2008
Springer
We present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the o...