Sciweavers

    2321 search results - page 71 / 465
    » Optimizing WebPage Interest
    Sort
    View
    SCHEDULING
    2010
    116views more  SCHEDULING 2010»
    Characterizing sets of jobs that admit optimal greedy-like algorithms
    13 years 7 months ago
    Characterizing sets of jobs that admit optimal greedy-like algorithms
    Download  www.cs.toronto.edu
    The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
    Periklis A. Papakonstantinou, Charles Rackoff
    claim paper
    Read More »
    COMPCON
    1995
    IEEE
    135views Computer Networks» more  COMPCON 1995»
    NetBill: An Internet Commerce System Optimized for Network Delivered Services
    14 years 14 days ago
    NetBill: An Internet Commerce System Optimized for Network Delivered Services
    Download  www.informedia.cs.cmu.edu
    Netbill is a business model, set of protocols, and software implementation for commerce in information goods and other network delivered services. It has very low transaction cost...
    Marvin A. Sirbu, J. D. Tygar
    claim paper
    Read More »
    DICTA
    2007
    114views Applied Computing» more  DICTA 2007»
    Optimizing Resources of an FPGA-based Smart Camera Architecture
    13 years 10 months ago
    Optimizing Resources of an FPGA-based Smart Camera Architecture
    Download  nicta.com.au
    The acceptance of reconfigurable platforms specifically FPGAs in embedded system design is becoming more apparent. While there are varieties of platforms available for smart cam...
    Amelia W. Azman, Abbas Bigdeli, Yasir Mohd-Mustafa...
    claim paper
    Read More »
    WICON
    2008
    104views Computer Networks» more  WICON 2008»
    What is optimal scheduling in wireless networks?
    13 years 10 months ago
    What is optimal scheduling in wireless networks?
    Download  maascom.ece.ohio-state.edu
    We consider a wireless network consisting of multiple transmitters with multicast traffic destined for a set of receivers. We are interested in the problem of joint scheduling and...
    Anna Pantelidou, Anthony Ephremides
    claim paper
    Read More »
    NIPS
    2003
    152views Information Technology» more  NIPS 2003»
    Learning Near-Pareto-Optimal Conventions in Polynomial Time
    13 years 10 months ago
    Learning Near-Pareto-Optimal Conventions in Polynomial Time
    Download  www-2.cs.cmu.edu
    We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
    Xiao Feng Wang, Tuomas Sandholm
    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.