Sciweavers

    10707 search results - page 2120 / 2142
    » Designing executable abstractions
    Sort
    View
    INFORMS
    1998
    150views more  INFORMS 1998»
    Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
    14 years 9 months ago
    Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
    Download  www.emn.fr
    constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
    Alexander Bockmayr, Thomas Kasper
    claim paper
    Read More »
    JASIS
    1998
    80views more  JASIS 1998»
    A Distributed Representation Approach to Group Problem Solving
    14 years 9 months ago
    A Distributed Representation Approach to Group Problem Solving
    Download  acad88.sahs.uth.tmc.edu
    This article develops a theoretical framework of distributed representations to explore the representational properties in group problem solving. The basic principle of distribute...
    Jiajie Zhang
    claim paper
    Read More »
    DC
    1999
    135views Internet Technology» more  DC 1999»
    A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
    14 years 9 months ago
    A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
    Download  courses.csail.mit.edu
    or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
    Michel Hurfin, Michel Raynal
    claim paper
    Read More »
    JUCS
    2002
    109views more  JUCS 2002»
    On Second Generation Distributed Component Systems
    14 years 9 months ago
    On Second Generation Distributed Component Systems
    Download  www.jucs.org
    Abstract: Two of today's most used buzz-words in the context of software development are the terms Componentware and Distributed Object-System. The combination of both ideas i...
    Klaus Schmaranz
    claim paper
    Read More »
    MOR
    2002
    94views more  MOR 2002»
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs
    14 years 9 months ago
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs
    Download  web.mit.edu
    ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
    Andreas S. Schulz, Robert Weismantel
    claim paper
    Read More »
    « Prev « First page 2120 / 2142 Last » Next »
    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.