Sciweavers

    BIRTHDAY
    2010
    Springer
    190views Applied Computing» more  BIRTHDAY 2010»
    Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
    13 years 5 months ago
    Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
    Download  www2.informatik.hu-berlin.de
    The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
    Martin Grohe
    claim paper
    Read More »
    AAAI
    1996
    95views Intelligent Agents» more  AAAI 1996»
    On the Size of Reactive Plans
    13 years 5 months ago
    On the Size of Reactive Plans
    Download  www.aaai.org
    One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...
    Peter Jonsson, Christer Bäckström
    claim paper
    Read More »
    UAI
    2000
    167views Artificial Intelligence» more  UAI 2000»
    Tractable Bayesian Learning of Tree Belief Networks
    13 years 5 months ago
    Tractable Bayesian Learning of Tree Belief Networks
    Download  www.stat.washington.edu
    In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
    Marina Meila, Tommi Jaakkola
    claim paper
    Read More »
    DAGSTUHL
    2006
    122views Software Engineering» more  DAGSTUHL 2006»
    Approximability of Minimum AND-Circuits
    13 years 6 months ago
    Approximability of Minimum AND-Circuits
    Download  www.stat.berkeley.edu
    Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that t...
    Jan Arpe, Bodo Manthey
    claim paper
    Read More »
    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    On the Maximum Span of Fixed-Angle Chains
    13 years 6 months ago
    On the Maximum Span of Fixed-Angle Chains
    Download  www.utdallas.edu
    Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
    Nadia Benbernou, Joseph O'Rourke
    claim paper
    Read More »
    AAAI
    2004
    116views Intelligent Agents» more  AAAI 2004»
    Combinatorial Auctions with Structured Item Graphs
    13 years 6 months ago
    Combinatorial Auctions with Structured Item Graphs
    Download  www.cs.duke.edu
    Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
    Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
    claim paper
    Read More »
    PLANX
    2007
    109views Programming Languages» more  PLANX 2007»
    Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
    13 years 6 months ago
    Deciding Equivalence of Top-Down XML Transformations in Polynomial Time
    Download  www2.in.tum.de
    Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...
    Sebastian Maneth, Helmut Seidl
    claim paper
    Read More »
    DLT
    2010
    153views Theoretical Computer Science» more  DLT 2010»
    Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
    13 years 6 months ago
    Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
    Download  139.18.4.2
    Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
    Niko Haubold, Markus Lohrey, Christian Mathissen
    claim paper
    Read More »
    AAAI
    2010
    181views Intelligent Agents» more  AAAI 2010»
    Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
    13 years 6 months ago
    Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
    Download  ccc.cs.uni-duesseldorf.de
    For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
    Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
    claim paper
    Read More »
    ATMOS
    2007
    119views Optimization» more  ATMOS 2007»
    Models for Railway Track Allocation
    13 years 6 months ago
    Models for Railway Track Allocation
    Download  drops.dagstuhl.de
    The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
    Ralf Borndörfer, Thomas Schlechte
    claim paper
    Read More »
    « first‹ previous…5678910111213…next ›last »
    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.