Sciweavers

    251 search results - page 29 / 51
    » Agents Talking Faster
    Sort
    View
    AAAI
    2004
    93views Intelligent Agents» more  AAAI 2004»
    Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
    13 years 11 months ago
    Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
    Download  v.vidal.free.fr
    A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
    Vincent Vidal, Hector Geffner
    claim paper
    Read More »
    AAAI
    1998
    129views Intelligent Agents» more  AAAI 1998»
    Optimal 2D Model Matching Using a Messy Genetic Algorithm
    13 years 11 months ago
    Optimal 2D Model Matching Using a Messy Genetic Algorithm
    Download  www.aaai.org
    A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
    J. Ross Beveridge
    claim paper
    Read More »
    AAAI
    1998
    90views Intelligent Agents» more  AAAI 1998»
    Inferring State Constraints for Domain-Independent Planning
    13 years 11 months ago
    Inferring State Constraints for Domain-Independent Planning
    Download  www.aaai.org
    Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
    Alfonso Gerevini, Lenhart K. Schubert
    claim paper
    Read More »
    AAAI
    2000
    188views Intelligent Agents» more  AAAI 2000»
    Solving Combinatorial Auctions Using Stochastic Local Search
    13 years 11 months ago
    Solving Combinatorial Auctions Using Stochastic Local Search
    Download  people.cs.ubc.ca
    Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
    Holger H. Hoos, Craig Boutilier
    claim paper
    Read More »
    AAAI
    2000
    193views Intelligent Agents» more  AAAI 2000»
    Depth-First Branch-and-Bound versus Local Search: A Case Study
    13 years 11 months ago
    Depth-First Branch-and-Bound versus Local Search: A Case Study
    Download  www.aaai.org
    Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
    Weixiong Zhang
    claim paper
    Read More »
    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.