301 search results - page 13 / 61 » On the Optimality of Probability Estimation by Random Decisi... |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
AUSDM
2008
Springer
13 years 10 months ago
2008
Springer
Accurate and less invasive personalized predictive medicine can spare many breast cancer patients from receiving complex surgical biopsies, unnecessary adjuvant treatments and its...
HEURISTICS
2002
13 years 7 months ago
2002
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...