Sciweavers

    2084 search results - page 211 / 417
    » Proving Time Bounds for Randomized Distributed Algorithms
    Sort
    View
    77
    Voted
    AUTOMATICA
    2010
    98views more  AUTOMATICA 2010»
    Explicit use of probabilistic distributions in linear predictive control
    14 years 9 months ago
    Explicit use of probabilistic distributions in linear predictive control
    Download  users.ox.ac.uk
    : The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
    Basil Kouvaritakis, Mark Cannon, Sasa V. Rakovic, ...
    claim paper
    Read More »
    MST
    2011
    231views Hardware» more  MST 2011»
    On the Complexity of Matroid Isomorphism Problem
    14 years 1 months ago
    On the Complexity of Matroid Isomorphism Problem
    Download  www.cse.iitm.ac.in
    We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
    B. V. Raghavendra Rao, Jayalal M. N. Sarma
    claim paper
    Read More »
    93
    Voted
    MOBIHOC
    2009
    ACM
    261views Computer Networks» more  MOBIHOC 2009»
    Aging rules: what does the past tell about the future in mobile ad-hoc networks?
    15 years 10 months ago
    Aging rules: what does the past tell about the future in mobile ad-hoc networks?
    Download  www4.ncsu.edu
    The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
    Han Cai, Do Young Eun
    claim paper
    Read More »
    ALGORITHMICA
    2002
    93views more  ALGORITHMICA 2002»
    Improved Algorithms for Uniform Partitions of Points
    14 years 10 months ago
    Improved Algorithms for Uniform Partitions of Points
    Download  www.cse.iitd.ernet.in
    We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
    Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
    claim paper
    Read More »
    ADHOC
    2006
    116views more  ADHOC 2006»
    Efficient clustering algorithms for self-organizing wireless sensor networks
    14 years 10 months ago
    Efficient clustering algorithms for self-organizing wireless sensor networks
    Download  people.bu.edu
    Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
    Rajesh Krishnan, David Starobinski
    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.