Sciweavers

16404 search results - page 928 / 3281
» A set coverage problem
Sort
View
ICML
2005
IEEE
16 years 8 months ago
Learning approximate preconditions for methods in hierarchical plans
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquir...
Dana S. Nau, David W. Aha, Héctor Muñ...
STOC
2003
ACM
136views Algorithms» more  STOC 2003»
16 years 8 months ago
Alpha-shapes and flow shapes are homotopy equivalent
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
Tamal K. Dey, Joachim Giesen, Matthias John
ICALP
2009
Springer
16 years 8 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
16 years 4 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
SOFSEM
2010
Springer
16 years 4 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
Alain Finkel, Arnaud Sangnier