Sciweavers

725 search results - page 65 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
PROCEDIA
2011
12 years 10 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
GECCO
2005
Springer
203views Optimization» more  GECCO 2005»
14 years 1 months ago
Ant colony optimization for power plant maintenance scheduling optimization
In order to maintain a reliable and economic electric power supply, the maintenance of power plants is becoming increasingly important. In this paper, a formulation that enables a...
Wai-Kuan Foong, Holger R. Maier, Angus R. Simpson
CIKM
2009
Springer
14 years 2 months ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
14 years 1 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
RTSS
2008
IEEE
14 years 2 months ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns