Sciweavers

2468 search results - page 356 / 494
» On Model Checking Techniques for Randomized Distributed Syst...
Sort
View
131
Voted
GECCO
2008
Springer
146views Optimization» more  GECCO 2008»
15 years 4 months ago
A formal performance modeling framework for bio-inspired ad hoc routing protocols
Bio-inspired ad hoc routing is an active area of research. The designers of these algorithms predominantly evaluate the performance of their protocols with the help of simulation ...
Muhammad Saleem, Syed Ali Khayam, Muddassar Farooq
DSN
2002
IEEE
15 years 8 months ago
Evaluation of the Maximum Level Reached by a Queue Over a Finite Period
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
Gerardo Rubino
WOA
2001
15 years 5 months ago
A Contract Decommitment Protocol for Automated Negotiation in Time Variant Environments
Negotiation is a fundamental mechanism in distributed multi-agent systems. Since negotiation is a time-spending process, in many scenarios agents have to take into account the pas...
Federico Bergenti, Agostino Poggi, Matteo Somacher
145
Voted
SSS
2007
Springer
130views Control Systems» more  SSS 2007»
15 years 9 months ago
Decentralized Detector Generation in Cooperative Intrusion Detection Systems
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...
Rainer Bye, Katja Luther, Seyit Ahmet Çamte...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 4 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah