Sciweavers

4860 search results - page 399 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
139
Voted
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 7 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li
142
Voted
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 7 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
CCCG
2007
15 years 5 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
165
Voted
CCCG
2008
15 years 5 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath