Sciweavers

3758 search results - page 400 / 752
» A Complete Subsumption Algorithm
Sort
View
DAM
2008
131views more  DAM 2008»
15 years 6 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
DEDS
2008
127views more  DEDS 2008»
15 years 6 months ago
Diagnosability Analysis of a Class of Hierarchical State Machines
This paper addresses the problem of Fault Detection and Isolation for a particular class of discrete event dynamical systems called Hierarchical Finite State Machines (HFSMs). A ne...
Andrea Paoli, Stéphane Lafortune
FMSD
2008
64views more  FMSD 2008»
15 years 6 months ago
Robust safety of timed automata
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea...
CI
2006
94views more  CI 2006»
15 years 6 months ago
Against Optimality: Logical Foundations for Decision-Theoretic Planning in Autonomous Agents
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
John L. Pollock
ENTCS
2006
114views more  ENTCS 2006»
15 years 6 months ago
Synthesis of Mealy Machines Using Derivatives
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutte...