Sciweavers

    1725 search results - page 3 / 345
    » Relaxed genetic programming
    Sort
    View
    FOGA
    1990
    135views Artificial Intelligence» more  FOGA 1990»
    A Hierarchical Approach to Learning the Boolean Multiplexer Function
    13 years 8 months ago
    A Hierarchical Approach to Learning the Boolean Multiplexer Function
    Download  www.genetic-programming.com
    This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
    John R. Koza
    claim paper
    Read More »
    VMCAI
    2005
    Springer
    80views Software Engineering» more  VMCAI 2005»
    Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
    14 years 1 months ago
    Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
    Download  www.di.ens.fr
    Patrick Cousot
    claim paper
    Read More »
    PAMI
    2000
    93views more  PAMI 2000»
    Hybrid Genetic Optimization and Statistical Model-Based Approach for the Classification of Shadow Shapes in Sonar Imagery
    13 years 7 months ago
    Hybrid Genetic Optimization and Statistical Model-Based Approach for the Classification of Shadow Shapes in Sonar Imagery
    Download  www.iro.umontreal.ca
    Max Mignotte, Christophe Collet, Patrick Pé...
    claim paper
    Read More »
    ICML
    2006
    IEEE
    144views Machine Learning» more  ICML 2006»
    Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
    14 years 8 months ago
    Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
    Download  www.cs.cmu.edu
    Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
    Pradeep D. Ravikumar, John D. Lafferty
    claim paper
    Read More »
    ENDM
    2010
    115views more  ENDM 2010»
    On the knapsack closure of 0-1 Integer Linear Programs
    13 years 4 months ago
    On the knapsack closure of 0-1 Integer Linear Programs
    Download  www.dei.unipd.it
    Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
    Matteo Fischetti, Andrea Lodi
    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.