Sciweavers

4514 search results - page 161 / 903
» Distributed Optimization in Adaptive Networks
Sort
View
ATAL
2009
Springer
15 years 2 months ago
Dynamic information source selection for intrusion detection systems
Our work presents a mechanism designed for the selection of the optimal information provider in a multi-agent, heterogeneous and unsupervised monitoring system. The selfadaptation...
Martin Rehák, Eugen Staab, Michal Pechoucek...
HEURISTICS
2002
65views more  HEURISTICS 2002»
14 years 10 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
OL
2011
190views Neural Networks» more  OL 2011»
14 years 5 months ago
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
Pavlo A. Krokhmal
BERTINORO
2005
Springer
15 years 3 months ago
Cooperative Content Distribution: Scalability Through Self-Organization
Abstract. Peer-to-peer networks have often been touted as the ultimate solution to scalability. Although cooperative techniques have been initially used almost exclusively for cont...
Pascal Felber, Ernst W. Biersack
DAGSTUHL
1996
14 years 11 months ago
Competitive Analysis of Distributed Algorithms
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
James Aspnes