Sciweavers

    660 search results - page 20 / 132
    » Hybrid CSP Solving
    Sort
    View
    ESA
    2000
    Springer
    112views Algorithms» more  ESA 2000»
    Resource Constrained Shortest Paths
    15 years 10 months ago
    Resource Constrained Shortest Paths
    Download  www.ziegelmann.info
    The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
    Kurt Mehlhorn, Mark Ziegelmann
    claim paper
    Read More »
    ENGL
    2007
    121views more  ENGL 2007»
    A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
    15 years 6 months ago
    A Comparison between Genetic Algorithms and Evolutionary Programming based on Cutting Stock Problem
    Download  www.engineeringletters.com
    —Genetic Algorithms (GA) and Evolutionary Programming (EP) are two well-known optimization methods that belong to the class of Evolutionary Algorithms (EA). Both methods have gen...
    Raymond Chiong, Ooi Koon Beng
    claim paper
    Read More »
    ATAL
    2009
    Springer
    99views Intelligent Agents» more  ATAL 2009»
    A hybrid approach to solving coarse-grained DisCSPs
    16 years 1 months ago
    A hybrid approach to solving coarse-grained DisCSPs
    Download  www.aamas-conference.org
    David Lee, Inés Arana, Hatem Ahriz, Kit-Yin...
    claim paper
    Read More »
    IPPS
    2006
    IEEE
    92views Distributed And Parallel Com...» more  IPPS 2006»
    A parallel exact hybrid approach for solving multi-objective problems on the computational grid
    16 years 17 days ago
    A parallel exact hybrid approach for solving multi-objective problems on the computational grid
    Download  www.cecs.uci.edu
    Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
    claim paper
    Read More »
    IWINAC
    2005
    Springer
    166views Artificial Intelligence» more  IWINAC 2005»
    Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound
    16 years 1 days ago
    Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound
    Download  www.lcc.uma.es
    José E. Gallardo, Carlos Cotta, Antonio J. ...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.