4759 search results - page 267 / 952 » Parallelizing the Phylogeny Problem |
107
click to vote
JPDC
2006
15 years 2 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
We show two severe problems with the state of the art in empirical computer system performance evaluation, observer effect and measurement context bias, and we outline the path to...
123
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
126
click to vote
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
: When the communication channels are subject to interruptions such as jamming, the coordination of the real time motions of distributed autonomous vehicles becomes a challenging p...
106
click to vote
ECOOPW
1999
Springer
15 years 6 months ago
1999
Springer
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...