Sciweavers

1603 search results - page 249 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 4 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
82
Voted
ICLP
1997
Springer
15 years 2 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
EUROGP
2010
Springer
160views Optimization» more  EUROGP 2010»
14 years 11 months ago
Improving the Generalisation Ability of Genetic Programming with Semantic Similarity based Crossover
This paper examines the impact of semantic control on the ability of Genetic Programming (GP) to generalise via a semantic based crossover operator (Semantic Similarity based Cross...
Nguyen Quang Uy, Nguyen Thi Hien, Nguyen Xuan Hoai...
TSMC
2008
99views more  TSMC 2008»
14 years 10 months ago
Robust Regularized Kernel Regression
Robust regression techniques are critical to fitting data with noise in real-world applications. Most previous work of robust kernel regression is usually formulated into a dual fo...
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
97
Voted
ICCV
2009
IEEE
16 years 3 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...