2214 search results - page 206 / 443 » complexity 2004 |
117
Voted
VOSS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
101
Voted
WABI
2004
Springer
15 years 8 months ago
2004
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...
115
Voted
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
140
Voted
WDAG
2004
Springer
15 years 8 months ago
2004
Springer
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
161
Voted
WER
2004
Springer
15 years 8 months ago
2004
Springer
Software systems of today are characterized by the increasing size, complexity, distribution and heterogeneity. Understanding and supporting the interaction between software requir...