Sciweavers

2814 search results - page 14 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
ESA
1999
Springer
105views Algorithms» more  ESA 1999»
14 years 26 days ago
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
Friedhelm Meyer auf der Heide, Berthold Vöcki...
DAM
1999
137views more  DAM 1999»
13 years 8 months ago
How to Find a Point on a Line Within a Fixed Distance
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in t...
Christoph A. Hipke, Christian Icking, Rolf Klein, ...
HCI
2007
13 years 10 months ago
Cooperation and Competition Dynamics in an Online Game Community
Cooperation and competition are important subjects in social and economical studies. Similar dynamics exists in large-scale online communities. In this paper, we present a quantita...
Ruixi Yuan, Li Zhao, Wenyu Wang
PPSN
2004
Springer
14 years 1 months ago
Distribution Tree-Building Real-Valued Evolutionary Algorithm
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
Petr Posik
PACT
1997
Springer
14 years 22 days ago
Parallel and Distributed Evolutionary Computation with MANIFOLD
Abstract. In this paper, we apply a competitive coevolutionary approach using loosely coupled genetic algorithms to a distributed optimization of the Rosenbrock's function. Th...
Franciszek Seredynski, Pascal Bouvry, Farhad Arbab