10 search results - page 2 / 2 » On Dissemination Thresholds in Regular and Irregular Graph C... |
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
82
Voted
SODA
2007
ACM
14 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
ASPLOS
2004
ACM
15 years 2 months ago
2004
ACM
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...