2814 search results - page 321 / 563 » Competitive Analysis of Distributed Algorithms |
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
110
Voted
NCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
102
click to vote
RTSS
1998
IEEE
15 years 4 months ago
1998
IEEE
In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and pr...
170
click to vote
SIGMOD
2008
ACM
16 years 16 days ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
101
Voted
ALMOB
2007
15 years 16 days ago
2007
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...