1074 search results - page 22 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
75
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Checkpointing is a very effective technique to tolerate the occurrence of failures in distributed and parallel applications. The existing algorithms in the literature are basicall...
ICS
2004
Tsinghua U.
15 years 3 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
SPAA
2009
ACM
15 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
76
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
109
click to vote
SRDS
1998
IEEE
15 years 1 months ago
1998
IEEE
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...