Sciweavers

666 search results - page 74 / 134
» Fair watermarking techniques
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
14 years 12 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
CONEXT
2008
ACM
14 years 11 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
PEWASUN
2005
ACM
15 years 3 months ago
Investigating unfairness scenarios in MANET using 802.11b
An experimental study of MANET using 802.11b has shown that there exist several configurations where this standard does not guarantee fairness for the channel access. In this pap...
Leïla Kloul, Fabrice Valois
FASE
2004
Springer
15 years 3 months ago
Enhancing Remote Method Invocation through Type-Based Static Analysis
Abstract. Distributed applications rely on middleware to enable interaction among remote components. Thus, the overall performance increasingly depends on the interplay between the...
Carlo Ghezzi, Vincenzo Martena, Gian Pietro Picco