Sciweavers

649 search results - page 123 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
DSRT
2004
IEEE
15 years 1 months ago
Exploring the Spatial Density of Strategy Models in a Realistic Distributed Interactive Application
As Distributed Interactive Applications (DIAs) become increasingly more prominent in the video game industry they must scale to accommodate progressively more users and maintain a...
Damien Marshall, Declan Delaney, Séamus McL...
PPSN
2000
Springer
15 years 1 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
CCE
2004
14 years 9 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
EUROPAR
2011
Springer
13 years 9 months ago
A Bit-Compatible Parallelization for ILU(k) Preconditioning
Abstract. ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present T...
Xin Dong 0004, Gene Cooperman
SENSYS
2003
ACM
15 years 2 months ago
Anchor-free distributed localization in sensor networks
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
Nissanka B. Priyantha, Hari Balakrishnan, Erik D. ...