67 search results - page 4 / 14 » Optimal Paths in Weighted Timed Automata |
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
PACT
2005
Springer
13 years 10 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...