374 search results - page 70 / 75 » Stochastic Minority on Graphs |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
DATAMINE
2010
13 years 7 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
IM
2007
13 years 7 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
COMBINATORICS
2004
13 years 7 months ago
2004
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
JCB
2002
13 years 7 months ago
2002
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The reg...