Sciweavers

    15 search results - page 1 / 3
    » Boltzmann Samplers for the Random Generation of Combinatoria...
    Sort
    View
    CPC
    2004
    82views more  CPC 2004»
    Boltzmann Samplers for the Random Generation of Combinatorial Structures
    13 years 4 months ago
    Boltzmann Samplers for the Random Generation of Combinatorial Structures
    Download  algo.inria.fr
    Philippe Duchon, Philippe Flajolet, Guy Louchard, ...
    claim paper
    Read More »
    SODA
    2007
    ACM
    76views Algorithms» more  SODA 2007»
    An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
    13 years 6 months ago
    An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
    Download  www.lix.polytechnique.fr
    We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
    Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
    claim paper
    Read More »
    SODA
    1996
    ACM
    95views Algorithms» more  SODA 1996»
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    13 years 6 months ago
    RNC Algorithms for the Uniform Generation of Combinatorial Structures
    Download  www.csc.liv.ac.uk
    We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
    Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    claim paper
    Read More »
    WSC
    1998
    163views Modeling And Simulation» more  WSC 1998»
    An Analytical Comparison of Optimization Problem Generation Methodologies
    13 years 6 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 »
    GECCO
    2009
    Springer
    86views Optimization» more  GECCO 2009»
    Evolving heuristically difficult instances of combinatorial problems
    13 years 8 months ago
    Evolving heuristically difficult instances of combinatorial problems
    Download  web.stcloudstate.edu
    When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
    Bryant A. Julstrom
    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.