Sciweavers

    1941 search results - page 27 / 389
    » On Generalizations of Network Design Problems with Degree Bo...
    Sort
    View
    TNN
    2010
    182views Management» more  TNN 2010»
    A discrete-time neural network for optimization problems with hybrid constraints
    13 years 2 months ago
    A discrete-time neural network for optimization problems with hybrid constraints
    Download  www1.i2r.a-star.edu.sg
    Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
    Huajin Tang, Haizhou Li, Zhang Yi
    claim paper
    Read More »
    ICCAD
    2003
    IEEE
    210views Hardware» more  ICCAD 2003»
    Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
    14 years 4 months ago
    Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
    Download  people.ee.duke.edu
    Energy consumption is an important performance parameter for portable and wireless embedded systems. However, energy consumption must be carefully balanced with real-time responsi...
    Vishnu Swaminathan, Krishnendu Chakrabarty
    claim paper
    Read More »
    CCS
    2009
    ACM
    205views Security Privacy» more  CCS 2009»
    The union-split algorithm and cluster-based anonymization of social networks
    14 years 8 months ago
    The union-split algorithm and cluster-based anonymization of social networks
    Download  www.cs.rutgers.edu
    Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
    Brian Thompson, Danfeng Yao
    claim paper
    Read More »
    NETWORKS
    2006
    93views Computer Networks» more  NETWORKS 2006»
    Extreme point characterizations for infinite network flow problems
    13 years 7 months ago
    Extreme point characterizations for infinite network flow problems
    Download  www-personal.umich.edu
    We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
    H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
    claim paper
    Read More »
    WIOPT
    2011
    IEEE
    253views Computer Networks» more  WIOPT 2011»
    Network utility maximization over partially observable Markovian channels
    12 years 11 months ago
    Network utility maximization over partially observable Markovian channels
    Download  www-scf.usc.edu
    Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
    Chih-Ping Li, Michael J. Neely
    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.