269 search results - page 36 / 54 » A branch and bound method for stochastic global optimization |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
105
click to vote
FGR
2004
IEEE
15 years 1 months ago
2004
IEEE
Solving the tracking of an articulated structure in a reasonable time is a complex task mainly due to the high dimensionality of the problem. A new optimization method, called Sto...
66
Voted
VMCAI
2005
Springer
15 years 3 months ago
2005
Springer
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
102
click to vote
IFM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...