1449 search results - page 47 / 290 » Self-Randomized Exponentiation Algorithms |
125
Voted
DC
2010
15 years 18 days ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
AUTOMATICA
2008
15 years 20 days ago
2008
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
104
click to vote
IPL
2008
15 years 16 days ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
92
Voted
AI
1999
Springer
15 years 6 days ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
IPPS
1993
IEEE
15 years 4 months ago
1993
IEEE
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...