782 search results - page 88 / 157 » MB-DPOP: A New Memory-Bounded Algorithm for Distributed Opti... |
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
CCGRID
2002
IEEE
14 years 2 months ago
2002
IEEE
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
GECCO
2007
Springer
14 years 3 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...
GECCO
2011
Springer
13 years 14 days ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...