Sciweavers

394 search results - page 57 / 79
» A framework for evolutionary optimization with approximate f...
Sort
View
ICCV
2009
IEEE
15 years 21 days ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
14 years 1 months ago
Particle swarm guided evolution strategy
Evolution strategy (ES) and particle swarm optimization (PSO) are two of the most popular research topics for tackling real-parameter optimization problems in evolutionary computa...
Chang-Tai Hsieh, Chih-Ming Chen, Ying-Ping Chen
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
ICSOC
2010
Springer
13 years 6 months ago
From Quality to Utility: Adaptive Service Selection Framework
Abstract. We consider an approach to service selection wherein service consumers choose services with desired nonfunctional properties to maximize their utility. A consumer’s uti...
Chung-Wei Hang, Munindar P. Singh
CGO
2008
IEEE
14 years 2 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout