Sciweavers

    1998 search results - page 107 / 400
    » Complexity of the Cover Polynomial
    Sort
    View
    CP
    2008
    Springer
    82views Artificial Intelligence» more  CP 2008»
    A Soft Constraint of Equality: Complexity and Approximability
    13 years 12 months ago
    A Soft Constraint of Equality: Complexity and Approximability
    Download  www.cs.ucc.ie
    We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
    Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
    claim paper
    Read More »
    PLANX
    2008
    127views Programming Languages» more  PLANX 2008»
    Complexity of Earliest Query Answering with Streaming Tree Automata
    13 years 11 months ago
    Complexity of Earliest Query Answering with Streaming Tree Automata
    Download  hal.inria.fr
    We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
    Olivier Gauwin, Anne-Cécile Caron, Joachim ...
    claim paper
    Read More »
    DAGSTUHL
    2006
    164views Software Engineering» more  DAGSTUHL 2006»
    On Complexity of Optimized Crossover for Binary Representations
    13 years 11 months ago
    On Complexity of Optimized Crossover for Binary Representations
    Download  drops.dagstuhl.de
    We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
    Anton V. Eremeev
    claim paper
    Read More »
    FSTTCS
    2008
    Springer
    172views Software Engineering» more  FSTTCS 2008»
    Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
    13 years 11 months ago
    Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
    Download  drops.dagstuhl.de
    For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
    Georg Moser, Andreas Schnabl, Johannes Waldmann
    claim paper
    Read More »
    AMC
    2008
    78views more  AMC 2008»
    Information processing in complex networks: Graph entropy and information functionals
    13 years 10 months ago
    Information processing in complex networks: Graph entropy and information functionals
    Download  lori.academicdirect.org
    This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
    Matthias Dehmer
    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.