2168 search results - page 220 / 434 » Randomized Algorithms and Complexity Theory |
119
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
126
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
136
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
121
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
144
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...