Sciweavers

4075 search results - page 62 / 815
» Modeling Distributed Algorithm Using B
Sort
View
CISS
2008
IEEE
13 years 9 months ago
Detection of anomalous meetings in a social network
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...
Jorge Silva, Rebecca Willett
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
EUROGP
2007
Springer
161views Optimization» more  EUROGP 2007»
14 years 3 months ago
Mining Distributed Evolving Data Streams Using Fractal GP Ensembles
A Genetic Programming based boosting ensemble method for the classification of distributed streaming data is proposed. The approach handles flows of data coming from multiple loc...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
ICARCV
2002
IEEE
185views Robotics» more  ICARCV 2002»
14 years 2 months ago
Evolving cooperative robotic behaviour using distributed genetic programming
Cooperative robotic systems provide design and implementation challenges that are not easy to solve. This paper describes a parallel implementation for evolving cooperative roboti...
Chris H. Messom, Matthew G. Walker
ECML
2005
Springer
14 years 2 months ago
U-Likelihood and U-Updating Algorithms: Statistical Inference in Latent Variable Models
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
JaeMo Sung, Sung Yang Bang, Seungjin Choi, Zoubin ...