Sciweavers

    721 search results - page 10 / 145
    » On Generators of Random Quasigroup Problems
    Sort
    View
    WSC
    1998
    163views Modeling And Simulation» more  WSC 1998»
    An Analytical Comparison of Optimization Problem Generation Methodologies
    13 years 9 months ago
    An Analytical Comparison of Optimization Problem Generation Methodologies
    Download  www.informs-sim.org
    Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
    Raymond R. Hill
    claim paper
    Read More »
    CP
    2003
    Springer
    96views Artificial Intelligence» more  CP 2003»
    Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
    14 years 1 months ago
    Generating High Quality Schedules for a Spacecraft Memory Downlink Problem
    Download  www.math.unipd.it
    This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
    Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabri...
    claim paper
    Read More »
    ALENEX
    2001
    151views Algorithms» more  ALENEX 2001»
    The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
    13 years 9 months ago
    The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
    Download  www.cs.wustl.edu
    The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
    Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
    claim paper
    Read More »
    ISSTA
    2006
    ACM
    92views Software Engineering» more  ISSTA 2006»
    Path-oriented random testing
    14 years 1 months ago
    Path-oriented random testing
    Download  www.cs.drexel.edu
    Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
    Arnaud Gotlieb, Matthieu Petit
    claim paper
    Read More »
    BMCBI
    2008
    136views more  BMCBI 2008»
    LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
    13 years 8 months ago
    LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
    Download  www.biomedcentral.com
    Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
    Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
    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.