Sciweavers

2814 search results - page 120 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
EUC
2006
Springer
15 years 6 months ago
Prediction Efficiency in Predictive p-CSMA/CD
Predictive p-persistent CSMA protocol is an important MAC solution developed for networked sensor/control applications and used in Local Operating Networks (LonWorks) technology. T...
Marek Miskowicz
PODC
2010
ACM
15 years 6 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
IPPS
1999
IEEE
15 years 6 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
IPPS
2006
IEEE
15 years 8 months ago
Towards an analysis of race carrier conditions in real-time Java
The RTSJ memory model propose a mechanism based on a scope three containing all region-stacks in the system and a reference-counter collector. In order to avoid reference cycles a...
M. Teresa Higuera-Toledano
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
15 years 6 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe