Sciweavers

    AIPS
    2006
    137views Artificial Intelligence» more  AIPS 2006»
    Challenges for Temporal Planning with Uncertain Durations
    13 years 5 months ago
    Challenges for Temporal Planning with Uncertain Durations
    Download  www.plg.inf.uc3m.es
    We investigate the problem of temporal planning with concurrent actions having stochastic durations, especially in the context of extended-state-space based planners. The problem ...
    Mausam, Daniel S. Weld
    claim paper
    Read More »
    AIPS
    2006
    150views Artificial Intelligence» more  AIPS 2006»
    Concurrent Probabilistic Planning in the Graphplan Framework
    13 years 5 months ago
    Concurrent Probabilistic Planning in the Graphplan Framework
    Download  users.cecs.anu.edu.au
    We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditi...
    Iain Little, Sylvie Thiébaux
    claim paper
    Read More »
    AIPS
    2006
    110views Artificial Intelligence» more  AIPS 2006»
    Optimal Rectangle Packing: A Meta-CSP Approach
    13 years 5 months ago
    Optimal Rectangle Packing: A Meta-CSP Approach
    Download  www.eecs.umich.edu
    We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
    Michael D. Moffitt, Martha E. Pollack
    claim paper
    Read More »
    AIPS
    2006
    120views Artificial Intelligence» more  AIPS 2006»
    A New Principle for Incremental Heuristic Search: Theoretical Results
    13 years 5 months ago
    A New Principle for Incremental Heuristic Search: Theoretical Results
    Download  www.cis.upenn.edu
    Planning is often not a one-shot task because either the world or the agent's knowledge of the world changes. In this paper, we introduce a new principle that can be used to ...
    Sven Koenig, Maxim Likhachev
    claim paper
    Read More »
    AIPS
    2006
    88views Artificial Intelligence» more  AIPS 2006»
    Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
    13 years 5 months ago
    Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
    Download  www.cs.cornell.edu
    In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
    Jörg Hoffmann, Carla P. Gomes, Bart Selman
    claim paper
    Read More »
    AIPS
    2006
    141views Artificial Intelligence» more  AIPS 2006»
    Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling
    13 years 5 months ago
    Combining Stochastic Task Models with Reinforcement Learning for Dynamic Scheduling
    Download  www.aaai.org
    We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...
    Malcolm J. A. Strens
    claim paper
    Read More »
    AIPS
    2006
    77views Artificial Intelligence» more  AIPS 2006»
    Stochastic Over-Subscription Planning Using Hierarchies of MDPs
    13 years 5 months ago
    Stochastic Over-Subscription Planning Using Hierarchies of MDPs
    Download  ti.arc.nasa.gov
    Nicolas Meuleau, Ronen I. Brafman, Emmanuel Benaze...
    claim paper
    Read More »
    AIPS
    2006
    107views Artificial Intelligence» more  AIPS 2006»
    Explanation-Based Acquisition of Planning Operators
    13 years 5 months ago
    Explanation-Based Acquisition of Planning Operators
    Download  www.cs.uiuc.edu
    Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
    Geoffrey Levine, Gerald DeJong
    claim paper
    Read More »
    AIPS
    2006
    113views Artificial Intelligence» more  AIPS 2006»
    Resource Contention Metrics for Oversubscribed Scheduling Problems
    13 years 5 months ago
    Resource Contention Metrics for Oversubscribed Scheduling Problems
    Download  www.ri.cmu.edu
    We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
    Laurence A. Kramer, Stephen F. Smith
    claim paper
    Read More »
    AIPS
    2006
    105views Artificial Intelligence» more  AIPS 2006»
    New Complexity Results for Classical Planning Benchmarks
    13 years 5 months ago
    New Complexity Results for Classical Planning Benchmarks
    Download  www.informatik.uni-freiburg.de
    The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
    Malte Helmert
    claim paper
    Read More »
    « first‹ previous123456next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.