Sciweavers

    2485 search results - page 17 / 497
    » Time Bounded Frequency Computations
    Sort
    View
    CDC
    2009
    IEEE
    149views Control Systems» more  CDC 2009»
    Stability and robustness conditions using frequency dependent half planes
    14 years 12 days ago
    Stability and robustness conditions using frequency dependent half planes
    Download  people.ece.cornell.edu
    — This paper presents a sufficient condition that establishes closed loop stability for linear time invariant dynamical systems with transfer functions that are analytic in the ...
    Krister Jacobsson, Lachlan L. H. Andrew, Ao Tang
    claim paper
    Read More »
    ICS
    2010
    Tsinghua U.
    137views Distributed And Parallel Com...» more  ICS 2010»
    Bounding Rationality by Discounting Time
    14 years 5 months ago
    Bounding Rationality by Discounting Time
    Download  conference.itcs.tsinghua.edu.cn
    Lance Fortnow, Rahul Santhanam
    claim paper
    Read More »
    PODC
    1994
    ACM
    108views Distributed and Parallel Com...» more  PODC 1994»
    Proving Time Bounds for Randomized Distributed Algorithms
    13 years 11 months ago
    Proving Time Bounds for Randomized Distributed Algorithms
    Download  groups.csail.mit.edu
    Nancy A. Lynch, Isaac Saias, Roberto Segala
    claim paper
    Read More »
    AUTOMATICA
    2007
    68views more  AUTOMATICA 2007»
    Frequency domain maximum likelihood estimation of linear dynamic errors-in-variables models
    13 years 7 months ago
    Frequency domain maximum likelihood estimation of linear dynamic errors-in-variables models
    Download  users.ecs.soton.ac.uk
    - This paper studies the linear dynamic errors-in-variables problem in the frequency domain. First the identifiability is shown under relaxed conditions. Next a frequency domain Ga...
    Rik Pintelon, Johan Schoukens
    claim paper
    Read More »
    FPCA
    1989
    110views Programming Languages» more  FPCA 1989»
    Automatic Complexity Analysis
    13 years 11 months ago
    Automatic Complexity Analysis
    Download  akira.ruc.dk
    One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
    Mads Rosendahl
    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.