Sciweavers

7228 search results - page 63 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
SIAMCOMP
1998
98views more  SIAMCOMP 1998»
15 years 2 months ago
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...
Marcos Kawazoe Aguilera, Sam Toueg
ATAL
2008
Springer
15 years 5 months ago
Automatic Generation of Distributed Team Formation Algorithms from Organizational Models
Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an exand abstract real-world reference presents a pr...
Michael Köhler-Bußmeier, Matthias Weste...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 9 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 5 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
MSWIM
2003
ACM
15 years 8 months ago
Randomized location service in mobile ad hoc networks
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
Sangeeta Bhattacharya