1603 search results - page 21 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
130
click to vote
CP
2004
Springer
15 years 3 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Active contour formulations predominate current minimization of the Mumford-Shah functional (MSF) for image segmentation and filtering. Unfortunately, these formulations necessitat...
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...