Sciweavers

13214 search results - page 364 / 2643
» Pseudorandomness for network algorithms
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 6 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
16 years 29 days ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
ISQED
2005
IEEE
119views Hardware» more  ISQED 2005»
16 years 12 days ago
Fast Decap Allocation Algorithm For Robust On-Chip Power Delivery
Adding on-chip decoupling capacitors (decaps) is an effective way to reduce voltage noise in power/ground networks and ensure robust power delivery. In this paper, we present a fa...
Zhenyu Qi, Hang Li, Sheldon X.-D. Tan, Lifeng Wu, ...
DSN
2003
IEEE
16 years 3 days ago
A Preemptive Deterministic Scheduling Algorithm for Multithreaded Replicas
Software-based active replication is expensive in terms of performance overhead. Multithreading can help improve performance; however, thread scheduling is a source of nondetermin...
Claudio Basile, Zbigniew Kalbarczyk, Ravishankar K...
DSN
2003
IEEE
16 years 3 days ago
An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...
Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, ...