Sciweavers

    2976 search results - page 90 / 596
    » On the bounded integer programming
    Sort
    View
    91
    Voted
    EOR
    2007
    78views more  EOR 2007»
    A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
    15 years 14 days ago
    A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
    Download  www.optimization-online.org
    Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
    Tolga Bektas, Osman Oguz, Iradj Ouveysi
    claim paper
    Read More »
    CONSTRAINTS
    2011
    224views Applied Computing» more  CONSTRAINTS 2011»
    CP and IP approaches to cancer radiotherapy delivery optimization
    14 years 4 months ago
    CP and IP approaches to cancer radiotherapy delivery optimization
    Download  ww2.cs.mu.oz.au
    Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
    Davaatseren Baatar, Natashia Boland, Sebastian Bra...
    claim paper
    Read More »
    66
    Voted
    ICALP
    1999
    Springer
    62views Programming Languages» more  ICALP 1999»
    Bounded Depth Arithmetic Circuits: Counting and Closure
    15 years 4 months ago
    Bounded Depth Arithmetic Circuits: Counting and Closure
    Download  ftp.cs.rutgers.edu
    Eric Allender, Andris Ambainis, David A. Mix Barri...
    claim paper
    Read More »
    62
    Voted
    IFIP
    1999
    Springer
    69views Programming Languages» more  IFIP 1999»
    Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
    15 years 4 months ago
    Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
    Download  eigold.tripod.com
    Luca P. Carloni, Evguenii I. Goldberg, Tiziano Vil...
    claim paper
    Read More »
    108
    Voted
    AAAI
    2006
    157views Intelligent Agents» more  AAAI 2006»
    Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
    15 years 1 months ago
    Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
    Download  www.dbai.tuwien.ac.at
    Several forms of reasoning in AI
    Georg Gottlob, Reinhard Pichler, Fang Wei
    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-2025, USA.