1082 search results - page 30 / 217 » Approximation Algorithms for Spreading Points |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...
SPAA
2010
ACM
14 years 12 days ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...