Sciweavers

3928 search results - page 375 / 786
» Optimal suffix selection
Sort
View
COLT
2005
Springer
16 years 10 days ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 10 months ago
Convergence to global optima for genetic programming systems with dynamically scaled operators
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
Lothar M. Schmitt, Stefan Droste
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 8 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
16 years 8 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
IPPS
2007
IEEE
16 years 1 months ago
Automatic Program Segment Similarity Detection in Targeted Program Performance Improvement
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
Haiping Wu, Eunjung Park, Mihailo Kaplarevic, Ying...