Sciweavers

460 search results - page 12 / 92
» A New Approach to Conformant Planning Using CNF*
Sort
View
ACTA
2007
92views more  ACTA 2007»
13 years 7 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
ICRA
2003
IEEE
171views Robotics» more  ICRA 2003»
14 years 20 days ago
Motion planning for multiple mobile robots using dynamic networks
- A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic ...
Christopher M. Clark, Stephen M. Rock, Jean-Claude...
IDEAL
2010
Springer
13 years 5 months ago
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Luke Dicken, John Levine
ICSE
1999
IEEE-ACM
13 years 11 months ago
Using a Goal-Driven Approach to Generate Test Cases for GUIs
The widespread use of GUIs for interacting with software is leading to the construction of more and more complex GUIs. With the growing complexity comes challenges in testing the ...
Atif M. Memon, Martha E. Pollack, Mary Lou Soffa
TON
2012
11 years 9 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...