Sciweavers

580 search results - page 42 / 116
» Performance evaluation of petri nets execution algorithms
Sort
View
SENSYS
2009
ACM
14 years 3 months ago
Run time assurance of application-level requirements in wireless sensor networks
Continuous and reliable operation of WSNs is notoriously difficult to guarantee due to hardware degradation and environmental changes. In this paper, we propose and demonstrate a ...
Jingyuan Li, Yafeng Wu, Krasimira Kapitanova, John...
ICASSP
2011
IEEE
13 years 21 days ago
Online performance guarantees for sparse recovery
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
Raja Giryes, Volkan Cevher
IPPS
2006
IEEE
14 years 3 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
ICAC
2006
IEEE
14 years 3 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
INFOCOM
1999
IEEE
14 years 1 months ago
CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...
Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bhargh...