Sciweavers

209 search results - page 32 / 42
» Dealing with stochastic reachability
Sort
View
IJCAI
2003
13 years 9 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
DEDS
2008
87views more  DEDS 2008»
13 years 7 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
IANDC
2008
114views more  IANDC 2008»
13 years 7 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
CVPR
2000
IEEE
14 years 9 months ago
A Curve Evolution Approach to Smoothing and Segmentation Using the Mumford-Shah Functional
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
CVPR
2004
IEEE
14 years 9 months ago
Motion Estimation by Swendsen-Wang Cuts
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
Adrian Barbu, Alan L. Yuille