Sciweavers

1994 search results - page 371 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
FLAIRS
2006
14 years 11 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
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...
Sanem Sariel, Tucker R. Balch
UAI
2004
14 years 11 months ago
Solving Factored MDPs with Continuous and Discrete Variables
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 ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
74
Voted
ECAI
2010
Springer
14 years 10 months ago
EP for Efficient Stochastic Control with Obstacles
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...
Thomas Mensink, Jakob J. Verbeek, Bert Kappen
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
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 ...
Thierry Benoist
IANDC
2008
84views more  IANDC 2008»
14 years 9 months ago
A theory of system behaviour in the presence of node and link failure
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...
Adrian Francalanza, Matthew Hennessy