Sciweavers

    42230 search results - page 62 / 8446
    » Algorithms and Complexity Results for
    Sort
    View
    MP
    2010
    145views more  MP 2010»
    The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
    14 years 8 months ago
    The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
    Download  www.diku.dk
    The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
    Irina Dumitrescu, Stefan Ropke, Jean-Franço...
    claim paper
    Read More »
    GECCO
    2010
    Springer
    180views Optimization» more  GECCO 2010»
    Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
    15 years 2 months ago
    Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
    Download  sci2s.ugr.es
    This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
    Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
    claim paper
    Read More »
    AAAI
    2004
    103views Intelligent Agents» more  AAAI 2004»
    Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
    14 years 11 months ago
    Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
    Download  www.aaai.org
    In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
    Csaba Szepesvári
    claim paper
    Read More »
    FIMI
    2004
    123views Data Mining» more  FIMI 2004»
    Surprising Results of Trie-based FIM Algorithms
    14 years 11 months ago
    Surprising Results of Trie-based FIM Algorithms
    Download  sunsite.informatik.rwth-aachen.de
    Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
    Ferenc Bodon
    claim paper
    Read More »
    ADG
    2006
    Springer
    204views Mathematics» more  ADG 2006»
    Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
    15 years 3 months ago
    Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
    Download  www.math.unm.edu
    This paper describes the recent convergence of four topics: polynomial systems, flexibility of three dimensional objects, computational chemistry, and computer algebra. We discuss...
    Robert H. Lewis, Evangelos A. Coutsias
    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-2025, USA.