608 search results - page 47 / 122 » On Dependent Randomized Rounding Algorithms |
111
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
109
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
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...
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
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...
CORR
2008
Springer
15 years 17 days ago
2008
Springer
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...
131
Voted
GEM
2007
15 years 1 months ago
2007
- 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 ...