Sciweavers

4372 search results - page 178 / 875
» Algorithmic Theories of Everything
Sort
View
105
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 1 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
108
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
104
Voted
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 6 months ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...
102
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
Lacra Pavel
EUROPAR
2004
Springer
15 years 6 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...