Sciweavers

353 search results - page 34 / 71
» From graph states to two-graph states
Sort
View
JAIR
2008
111views more  JAIR 2008»
13 years 8 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 7 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
AIS
2004
Springer
13 years 11 months ago
Timed I/O Test Sequences for Discrete Event Model Verification
Abstract. Model verification examines the correctness of a model implementation with respect to a model specification. While being described from model specification, implementatio...
Ki Jung Hong, Tag Gon Kim
ICASSP
2007
IEEE
14 years 2 months ago
Particle PHD Filtering for Multi-Target Visual Tracking
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
Emilio Maggio, Elisa Piccardo, Carlo S. Regazzoni,...
CSL
2003
Springer
14 years 1 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...