4759 search results - page 360 / 952 » Parallelizing the Phylogeny Problem |
189
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
176
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
— Skewed-associative caches use several hash functions to reduce collisions in caches without increasing the associativity. This technique can increase the hit ratio of a cache w...
163
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
195
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
154
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...