Sciweavers

    835 search results - page 70 / 167
    » Adaptive Bound Optimization for Online Convex Optimization
    Sort
    View
    TCAD
    2008
    172views more  TCAD 2008»
    General Methodology for Soft-Error-Aware Power Optimization Using Gate Sizing
    14 years 9 months ago
    General Methodology for Soft-Error-Aware Power Optimization Using Gate Sizing
    Download  www.cs.ucla.edu
    Power consumption has emerged as the premier and most constraining aspect in modern microprocessor and application-specific designs. Gate sizing has been shown to be one of the mos...
    Foad Dabiri, Ani Nahapetian, Tammara Massey, Miodr...
    claim paper
    Read More »
    GECCO
    2004
    Springer
    67views Optimization» more  GECCO 2004»
    A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
    15 years 3 months ago
    A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
    Download  www-i1.informatik.rwth-aachen.de
    Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
    Simon Fischer
    claim paper
    Read More »
    NETWORKS
    2008
    86views Computer Networks» more  NETWORKS 2008»
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    14 years 9 months ago
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    Download  www-personal.umich.edu
    Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
    Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
    claim paper
    Read More »
    JSAC
    2008
    111views more  JSAC 2008»
    The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
    14 years 9 months ago
    The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
    Download  repository.ust.hk
    In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
    Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
    claim paper
    Read More »
    UAI
    2003
    144views Artificial Intelligence» more  UAI 2003»
    Active Collaborative Filtering
    14 years 11 months ago
    Active Collaborative Filtering
    Download  www.cs.toronto.edu
    Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
    Craig Boutilier, Richard S. Zemel, Benjamin M. Mar...
    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.