Sciweavers

    77 search results - page 16 / 16
    » Enumeration Reducibility with Polynomial Time Bounds
    Sort
    View
    TIT
    2010
    115views Education» more  TIT 2010»
    On resource allocation in fading multiple-access channels-an efficient approximate projection approach
    13 years 29 days ago
    On resource allocation in fading multiple-access channels-an efficient approximate projection approach
    Download  web.mit.edu
    We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
    Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
    claim paper
    Read More »
    TACAS
    2004
    Springer
    122views Algorithms» more  TACAS 2004»
    A Scalable Incomplete Test for the Boundedness of UML RT Models
    13 years 11 months ago
    A Scalable Incomplete Test for the Boundedness of UML RT Models
    Download  www.inf.uni-konstanz.de
    Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
    Stefan Leue, Richard Mayr, Wei Wei
    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.