Sciweavers

20 search results - page 2 / 4
» Evaluating Temporal Plans in Incomplete Domains
Sort
View
IJCAI
2007
13 years 6 months ago
A Heuristic Search Approach to Planning with Temporally Extended Preferences
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
AIPS
2009
13 years 6 months ago
Semantic Attachments for Domain-Independent Planning Systems
Solving real-world problems using symbolic planning often requires a simplified formulation of the original problem, since certain subproblems cannot be represented at all or only...
Christian Dornhege, Patrick Eyerich, Thomas Keller...
CCS
2011
ACM
12 years 5 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
AIPS
2009
13 years 6 months ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml
KIVS
2005
Springer
13 years 10 months ago
An Integrated Simulator for Inter-Domain Scenarios
Abstract. The simulation of large-scale inter-domain networks is useful for various aspects of network planning and management. It is also a challenge due to its scalability proble...
Matthias Scheidegger, Florian Baumgartner, Torsten...