In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...