Sciweavers

1632 search results - page 95 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
105
Voted
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
15 years 9 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
126
Voted
ENTCS
2006
136views more  ENTCS 2006»
15 years 3 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
GECCO
2009
Springer
104views Optimization» more  GECCO 2009»
15 years 10 months ago
Sustaining diversity using behavioral information distance
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
Faustino J. Gomez
152
Voted
ICTAI
2002
IEEE
15 years 8 months ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
122
Voted
ECAI
2010
Springer
15 years 3 months ago
Mining Outliers with Adaptive Cutoff Update and Space Utilization (RACAS)
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
Chi-Cheong Szeto, Edward Hung