Sciweavers

377 search results - page 7 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 2 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
14 years 19 days ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
EOR
2007
364views more  EOR 2007»
13 years 8 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
ICDCS
2010
IEEE
13 years 10 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
IJCAI
2003
13 years 10 months ago
FastSLAM 2.0: An Improved Particle Filtering Algorithm for Simultaneous Localization and Mapping that Provably Converges
Proceedings of IJCAI 2003 In [15], Montemerlo et al. proposed an algorithm called FastSLAM as an efficient and robust solution to the simultaneous localization and mapping proble...
Michael Montemerlo, Sebastian Thrun, Daphne Koller...