Sciweavers

379 search results - page 52 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
COCOON
2007
Springer
13 years 11 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
13 years 11 months ago
Revisiting evolutionary algorithms with on-the-fly population size adjustment
In an evolutionary algorithm, the population has a very important role as its size has direct implications regarding solution quality, speed, and reliability. Theoretical studies ...
Fernando G. Lobo, Cláudio F. Lima
DAC
1997
ACM
13 years 11 months ago
Quadratic Placement Revisited
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
13 years 11 months ago
A Revisit of Query Expansion with Different Semantic Levels
Abstract. Query expansion has received extensive attention in information retrieval community. Although semantic based query expansion appears to be promising in improving retrieva...
Ce Zhang, Bin Cui, Gao Cong, Yu-Jing Wang
CP
2006
Springer
13 years 11 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider