Sciweavers

    293 search results - page 47 / 59
    » Optimal Integer Alphabetic Trees in Linear Time
    Sort
    View
    DAC
    2002
    ACM
    116views Computer Architecture» more  DAC 2002»
    ILP-based engineering change
    14 years 8 months ago
    ILP-based engineering change
    Download  www.cs.ucla.edu
    We have developed a generic integer linear programming(ILP)based engineering change(EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabl...
    Farinaz Koushanfar, Jennifer L. Wong, Jessica Feng...
    claim paper
    Read More »
    IOR
    2007
    106views more  IOR 2007»
    Planning and Scheduling by Logic-Based Benders Decomposition
    13 years 7 months ago
    Planning and Scheduling by Logic-Based Benders Decomposition
    Download  wpweb2.tepper.cmu.edu
    We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
    John N. Hooker
    claim paper
    Read More »
    OPODIS
    2004
    133views Distributed And Parallel Com...» more  OPODIS 2004»
    Self-optimizing DHTs Using Request Profiling
    13 years 9 months ago
    Self-optimizing DHTs Using Request Profiling
    Download  www.selfstabilization.org
    S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
    Alina Bejan, Sukumar Ghosh
    claim paper
    Read More »
    JAIR
    2010
    77views more  JAIR 2010»
    Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
    13 years 6 months ago
    Resource-Driven Mission-Phasing Techniques for Constrained Agents in Stochastic Environments
    Download  www.jair.org
    Because an agent’s resources dictate what actions it can possibly take, it should plan which resources it holds over time carefully, considering its inherent limitations (such a...
    E. H. Durfee Wu, Edmund H. Durfee
    claim paper
    Read More »
    ICNP
    2002
    IEEE
    139views Computer Networks» more  ICNP 2002»
    An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
    14 years 20 days ago
    An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
    Download  www.ieee-icnp.org
    — This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
    Dahai Xu, Chunming Qiao, Yizhi Xiong
    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.