2367 search results - page 100 / 474 » An experimental analysis of self-adjusting computation |
PDPTA
2000
15 years 1 months ago
2000
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...
CASCON
1996
15 years 1 months ago
1996
The performance of host communication subsystems is an important research topic in computer networks.1 Performance metrics such as throughput, delay, and packet loss are important...
101
click to vote
TSP
2008
14 years 11 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
106
click to vote
TCS
2010
14 years 10 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
111
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...