Sciweavers

5105 search results - page 48 / 1021
» An algorithm to determine peer-reviewers
Sort
View
ICPP
1999
IEEE
14 years 3 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
SWARM
2008
SPRINGER
108views Optimization» more  SWARM 2008»
13 years 11 months ago
A framework of space-time continuous models for algorithm design in swarm robotics
Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot's interior. It is difficul...
Heiko Hamann, Heinz Wörn
PR
2002
134views more  PR 2002»
13 years 10 months ago
Interactive clustering and merging with a new fuzzy expected value
7 Major problems exist in both crisp and fuzzy clustering algorithms. The fuzzy c-means type of algorithms use weights determined by a power m of inverse distances that remains
Carl G. Looney
IWOCA
2009
Springer
123views Algorithms» more  IWOCA 2009»
14 years 5 months ago
Computability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
Petr Skoda
TEC
2012
234views Formal Methods» more  TEC 2012»
12 years 1 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao