1029 search results - page 156 / 206 » Neural Networks and Complexity Theory |
168
click to vote
DATAMINE
2010
15 years 4 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...
124
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
172
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
148
click to vote
ACSW
2006
15 years 5 months ago
2006
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
135
click to vote
MIS
2007
Springer
15 years 3 months ago
2007
Springer
Mobility models, synthetic or trace, try to accurately model the movement of a single user or a group of users. Models are used in simulators and emulators to investigate the cons...