1994 search results - page 371 / 399 » Computation of Optical Flow Using Dynamic Programming |
115
Voted
FLAIRS
2006
15 years 3 months ago
2006
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
131
Voted
UAI
2004
15 years 3 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
109
Voted
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
131
click to vote
EOR
2008
15 years 2 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
IANDC
2008
15 years 2 months ago
2008
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...