Sciweavers

    524 search results - page 27 / 105
    » An Optimal Lower Bound on the Communication Complexity of Ga...
    Sort
    View
    CDC
    2009
    IEEE
    144views Control Systems» more  CDC 2009»
    Stochastic control over finite capacity channels: Causality, feedback and uncertainty
    13 years 11 months ago
    Stochastic control over finite capacity channels: Causality, feedback and uncertainty
    Download  www.c4c-project.eu
    Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
    Charalambos D. Charalambous, Christos K. Kourtella...
    claim paper
    Read More »
    INFOCOM
    2009
    IEEE
    246views Communications» more  INFOCOM 2009»
    Delay Analysis for Multi-Hop Wireless Networks
    14 years 2 months ago
    Delay Analysis for Multi-Hop Wireless Networks
    Download  maascom.ece.ohio-state.edu
    Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
    Gagan Rajesh Gupta, Ness B. Shroff
    claim paper
    Read More »
    JMLR
    2006
    117views more  JMLR 2006»
    On the Complexity of Learning Lexicographic Strategies
    13 years 7 months ago
    On the Complexity of Learning Lexicographic Strategies
    Download  www.ruhr-uni-bochum.de
    Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
    Michael Schmitt, Laura Martignon
    claim paper
    Read More »
    JGAA
    2006
    127views more  JGAA 2006»
    A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
    13 years 7 months ago
    A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
    Download  jgaa.info
    We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
    Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
    claim paper
    Read More »
    JC
    2007
    94views more  JC 2007»
    On the complexity of the multivariate Sturm-Liouville eigenvalue problem
    13 years 7 months ago
    On the complexity of the multivariate Sturm-Liouville eigenvalue problem
    Download  www.cs.columbia.edu
    We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
    A. Papageorgiou
    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.