Sciweavers

2555 search results - page 172 / 511
» Quantifiers and Working Memory
Sort
View
120
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints
Multimedia streaming applications have stringent QoS requirements. Typically each packet is associated with a packet delivery deadline. This work models and considers realtime stre...
Xiaohang Li, Chih-Chun Wang, Xiaojun Lin
163
Voted
ICWS
2009
IEEE
15 years 1 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang
135
Voted
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
13 years 6 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
148
Voted
ASPDAC
2005
ACM
106views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Using loop invariants to fight soft errors in data caches
Ever scaling process technology makes embedded systems more vulnerable to soft errors than in the past. One of the generic methods used to fight soft errors is based on duplicati...
Sri Hari Krishna Narayanan, Seung Woo Son, Mahmut ...
SPIN
2007
Springer
15 years 10 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro