Sciweavers

213 search results - page 24 / 43
» Heuristics for Planning with Action Costs
Sort
View
AIPS
2008
13 years 10 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 9 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
JAIR
2008
98views more  JAIR 2008»
13 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Building Computer Network Attacks
In this work we start walking the path to a new perspective for viewing cyberwarfare scenarios, by introducing conceptual tools (a formal model) to evaluate the costs of an attack...
Ariel Futoransky, Luciano Notarfrancesco, Gerardo ...
AAAI
2008
13 years 10 months ago
Probabilistic Planning via Determinization in Hindsight
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hind...
Sung Wook Yoon, Alan Fern, Robert Givan, Subbarao ...