Sciweavers

504 search results - page 72 / 101
» Explaining Verification Conditions
Sort
View
AAAI
2006
13 years 9 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
13 years 8 months ago
Continuous trajectory planning of mobile sensors for informative forecasting
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...
Han-Lim Choi, Jonathan P. How
ENTCS
2006
142views more  ENTCS 2006»
13 years 8 months ago
Specialization of Interaction Protocols in a Temporal Action Logic
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where c...
Laura Giordano, Alberto Martelli, Camilla Schwind
PR
2002
202views more  PR 2002»
13 years 7 months ago
Illumination color covariant locale-based visual object retrieval
Search by Object Model -- finding an object inside a target image -- is a desirable and yet difficult mechanism for querying multimedia data. An added difficulty is that objects c...
Mark S. Drew, Ze-Nian Li, Zinovi Tauber
KBSE
2010
IEEE
13 years 6 months ago
RESISTing reliability degradation through proactive reconfiguration
Situated software systems are an emerging class of systems that are predominantly pervasive, embedded, and mobile. They are marked with a high degree of unpredictability and dynam...
Deshan Cooray, Sam Malek, Roshanak Roshandel, Davi...