Sciweavers

    929 search results - page 2 / 186
    » heuristics 2008
    Sort
    View
    MANSCI
    2008
    63views more  MANSCI 2008»
    Inventory Models for Substitutable Products: Optimal Policies and Heuristics
    13 years 5 months ago
    Inventory Models for Substitutable Products: Optimal Policies and Heuristics
    Download  opimweb.wharton.upenn.edu
    Mahesh Nagarajan, S. Rajagopalan
    claim paper
    Read More »
    AIPS
    2008
    131views Artificial Intelligence» more  AIPS 2008»
    Additive-Disjunctive Heuristics for Optimal Planning
    13 years 7 months ago
    Additive-Disjunctive Heuristics for Optimal Planning
    Download  www.cis.strath.ac.uk
    The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
    Andrew Coles, Maria Fox, Derek Long, Amanda Smith
    claim paper
    Read More »
    AIPS
    2008
    95views Artificial Intelligence» more  AIPS 2008»
    Learning Heuristic Functions through Approximate Linear Programming
    13 years 7 months ago
    Learning Heuristic Functions through Approximate Linear Programming
    Download  anytime.cs.umass.edu
    Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
    Marek Petrik, Shlomo Zilberstein
    claim paper
    Read More »
    AIPS
    2008
    112views Artificial Intelligence» more  AIPS 2008»
    Unifying the Causal Graph and Additive Heuristics
    13 years 7 months ago
    Unifying the Causal Graph and Additive Heuristics
    Download  www.tecn.upf.es
    Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
    Malte Helmert, Hector Geffner
    claim paper
    Read More »
    ACL
    2008
    124views Computational Linguistics» more  ACL 2008»
    splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications
    13 years 6 months ago
    splitSVM: Fast, Space-Efficient, non-Heuristic, Polynomial Kernel Computation for NLP Applications
    Download  www.cs.bgu.ac.il
    Yoav Goldberg, Michael Elhadad
    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.