Sciweavers

    2020 search results - page 25 / 404
    » Speeding up Slicing
    Sort
    View
    STOC
    1991
    ACM
    163views Algorithms» more  STOC 1991»
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    13 years 11 months ago
    Clique Partitions, Graph Compression, and Speeding-Up Algorithms
    Download  www.combinatorics.net
    Tomás Feder, Rajeev Motwani
    claim paper
    Read More »
    DLOG
    2007
    140views Automated Reasoning» more  DLOG 2007»
    Speeding up Approximation with Nicer Concepts
    13 years 9 months ago
    Speeding up Approximation with Nicer Concepts
    Download  dl.kr.org
    Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
    Anni-Yasmin Turhan, Yusri Bong
    claim paper
    Read More »
    CPAIOR
    2008
    Springer
    114views Operations Research» more  CPAIOR 2008»
    Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
    13 years 9 months ago
    Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
    Download  www.crt.umontreal.ca
    Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
    Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi...
    claim paper
    Read More »
    ATMOS
    2007
    84views Optimization» more  ATMOS 2007»
    Experimental Study on Speed-Up Techniques for Timetable Information Systems
    13 years 9 months ago
    Experimental Study on Speed-Up Techniques for Timetable Information Systems
    Download  www.math.tu-berlin.de
    Reinhard Bauer, Daniel Delling, Dorothea Wagner
    claim paper
    Read More »
    AAAI
    2010
    174views Intelligent Agents» more  AAAI 2010»
    To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
    13 years 9 months ago
    To Max or Not to Max: Online Learning for Speeding Up Optimal Planning
    Download  www.technion.ac.il
    It is well known that there cannot be a single "best" heuristic for optimal planning in general. One way of overcoming this is by combining admissible heuristics (e.g. b...
    Carmel Domshlak, Erez Karpas, Shaul Markovitch
    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.