966 search results - page 119 / 194 » Small Alliances in Graphs |
140
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
195
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
180
click to vote
ICDCS
2002
IEEE
15 years 10 months ago
2002
IEEE
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
142
click to vote
IWPC
2002
IEEE
15 years 10 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
133
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...