Sciweavers

8094 search results - page 226 / 1619
» Improvements in Formula Generalization
Sort
View
MFCS
2009
Springer
14 years 3 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
CIKM
2001
Springer
14 years 3 months ago
Improved String Matching Under Noisy Channel Conditions
Many document-based applications, including popular Web browsers, email viewers, and word processors, have a ‘Find on this Page’ feature that allows a user to find every occur...
Kevyn Collins-Thompson, Charles Schweizer, Susan T...
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
14 years 2 months ago
Improved step size adaptation for the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is an evolutionary algorithm for continuous vector-valued optimization. It combines indicator-based...
Thomas Voß, Nikolaus Hansen, Christian Igel
DAC
2004
ACM
14 years 2 months ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
14 years 2 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...