Sciweavers

5448 search results - page 411 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
TCS: Estimating Gene Genealogies
Phylogentic analysis is becoming an increasingly important tool for customized drug treatments, epidemiological studies, and evolutionary analysis. The TCS method provides an impo...
Mark J. Clement, Quinn Snell, Peter Walker, David ...
IPPS
2002
IEEE
15 years 11 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
ISORC
2002
IEEE
15 years 11 months ago
Practical Considerations in Making CORBA Services Fault-Tolerant
This paper examines the CORBA Naming, Event, Notification, Trading, Time and Security Services, with the objective of identifying the issues that must be addressed in order make ...
Priya Narasimhan
EUROPAR
2009
Springer
15 years 11 months ago
A New Genetic Algorithm for Scheduling for Large Communication Delays
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
Johnatan E. Pecero, Denis Trystram, Albert Y. Zoma...
IPPS
2000
IEEE
15 years 11 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar