2814 search results - page 259 / 563 » Competitive Analysis of Distributed Algorithms |
91
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
104
click to vote
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
97
Voted
ICANNGA
2009
Springer
15 years 7 months ago
2009
Springer
A statistical generative model is presented as an alternative to negative selection in anomaly detection of string data. We extend the probabilistic approach to binary classificat...
110
click to vote
COMCOM
2004
15 years 14 days ago
2004
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
78
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...