Sciweavers

    13 search results - page 2 / 3
    » A correct proof of the heuristic GCD algorithm
    Sort
    View
    CADE
    2005
    Springer
    198views Logical Reasoning» more  CADE 2005»
    A Proof-Producing Decision Procedure for Real Arithmetic
    14 years 6 months ago
    A Proof-Producing Decision Procedure for Real Arithmetic
    Download  www.cl.cam.ac.uk
    We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
    Sean McLaughlin, John Harrison
    claim paper
    Read More »
    JACM
    2006
    99views more  JACM 2006»
    Finding a maximum likelihood tree is hard
    13 years 6 months ago
    Finding a maximum likelihood tree is hard
    Download  www.cs.tau.ac.il
    Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
    Benny Chor, Tamir Tuller
    claim paper
    Read More »
    ANCS
    2008
    ACM
    185views Computer Networks» more  ANCS 2008»
    On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
    13 years 8 months ago
    On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
    Download  www.arl.wustl.edu
    The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
    Yunyue Lin, Qishi Wu
    claim paper
    Read More »
    INFOCOM
    2009
    IEEE
    156views Communications» more  INFOCOM 2009»
    Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
    14 years 27 days ago
    Circuits/Cutsets Duality and a Unified Algorithmic Framework for Survivable Logical Topology Design in IP-over-WDM Optical Netwo
    Download  www.cs.ou.edu
    : Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
    Krishnaiyan Thulasiraman, Muhammad S. Javed, Guoli...
    claim paper
    Read More »
    FLAIRS
    2004
    121views Artificial Intelligence» more  FLAIRS 2004»
    Concurrent Backtrack Search on DisCSPs
    13 years 7 months ago
    Concurrent Backtrack Search on DisCSPs
    Download  www.aaai.org
    A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
    Roie Zivan, Amnon Meisels
    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.