Sciweavers

    6960 search results - page 105 / 1392
    » Continuity Analysis of Programs
    Sort
    View
    ICLP
    2005
    Springer
    96views Automated Reasoning» more  ICLP 2005»
    Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis
    16 years 6 days ago
    Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis
    Download  www.informatik.uni-ulm.de
    Thom W. Frühwirth
    claim paper
    Read More »
    SIGADA
    2005
    Springer
    78views Programming Languages» more  SIGADA 2005»
    Scheduling and memory requirements analysis with AADL
    16 years 5 days ago
    Scheduling and memory requirements analysis with AADL
    Download  www.sigada.org
    Frank Singhoff, Jérôme Legrand, Laure...
    claim paper
    Read More »
    IFIP
    2004
    Springer
    90views Programming Languages» more  IFIP 2004»
    Software Rejuvenation - Modeling and Analysis
    16 years 2 days ago
    Software Rejuvenation - Modeling and Analysis
    Download  www.crhc.illinois.edu
    Kishor S. Trivedi, Kalyanaraman Vaidyanathan
    claim paper
    Read More »
    CEC
    2008
    IEEE
    217views Artificial Intelligence» more  CEC 2008»
    Geometric PSO + GP = Particle Swarm Programming
    16 years 1 months ago
    Geometric PSO + GP = Particle Swarm Programming
    Download  julian.togelius.com
    —Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
    Julian Togelius, Renzo De Nardi, Alberto Moraglio
    claim paper
    Read More »
    189
    Voted
    CPAIOR
    2006
    Springer
    101views Operations Research» more  CPAIOR 2006»
    A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
    15 years 10 months ago
    A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
    Download  www.cs.brown.edu
    Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
    Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
    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.