Sciweavers

    1312 search results - page 163 / 263
    » Formally Optimal Boxing
    Sort
    View
    OPODIS
    2008
    166views Distributed And Parallel Com...» more  OPODIS 2008»
    Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
    13 years 11 months ago
    Evaluating a Data Removal Strategy for Grid Environments Using Colored Petri Nets
    Download  alexandria.tue.nl
    Abstract. In this paper we use colored Petri nets (CPNs) and the supporting CPN Tools for the modeling and performance analysis of grid architectures. The notation of Petri nets is...
    Nikola Trcka, Wil M. P. van der Aalst, Carmen Brat...
    claim paper
    Read More »
    NAACL
    2007
    91views Computational Linguistics» more  NAACL 2007»
    Randomized Decoding for Selection-and-Ordering Problems
    13 years 11 months ago
    Randomized Decoding for Selection-and-Ordering Problems
    Download  people.csail.mit.edu
    The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
    Pawan Deshpande, Regina Barzilay, David R. Karger
    claim paper
    Read More »
    NETWORKING
    2007
    128views Computer Networks» more  NETWORKING 2007»
    Delivery Guarantees in Predictable Disruption Tolerant Networks
    13 years 11 months ago
    Delivery Guarantees in Predictable Disruption Tolerant Networks
    Download  ftp.run.montefiore.ulg.ac.be
    This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one ...
    Jean-Marc François, Guy Leduc
    claim paper
    Read More »
    SODA
    2008
    ACM
    71views Algorithms» more  SODA 2008»
    Two-phase greedy algorithms for some classes of combinatorial linear programs
    13 years 11 months ago
    Two-phase greedy algorithms for some classes of combinatorial linear programs
    Download  grid.tsinghua.edu.cn
    We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
    Ulrich Faigle, Britta Peis
    claim paper
    Read More »
    AAAI
    2004
    109views Intelligent Agents» more  AAAI 2004»
    Extending CP-Nets with Stronger Conditional Preference Statements
    13 years 11 months ago
    Extending CP-Nets with Stronger Conditional Preference Statements
    Download  www.aaai.org
    A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
    Nic Wilson
    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.