Sciweavers

    2 search results - page 1 / 1
    » The Gn, m Phase Transition is Not Hard for the Hamiltonian C...
    Sort
    View
    JAIR
    1998
    92views more  JAIR 1998»
    The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
    13 years 4 months ago
    The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
    Download  www.jair.org
    Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
    Basil Vandegriend, Joseph C. Culberson
    claim paper
    Read More »
    18
    Voted
    SARA
    2009
    Springer
    231views Artificial Intelligence» more  SARA 2009»
    Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
    13 years 11 months ago
    Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
    Download  webdocs.cs.ualberta.ca
    We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
    Miroslav N. Velev, Ping Gao 0002
    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.