Sciweavers

8723 search results - page 1348 / 1745
» A New Analysis of Co-Training
Sort
View
IPPS
1998
IEEE
15 years 11 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
IPPS
1998
IEEE
15 years 11 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
SIGMETRICS
1998
ACM
110views Hardware» more  SIGMETRICS 1998»
15 years 11 months ago
LoGPC: Modeling Network Contention in Message-Passing Programs
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
Csaba Andras Moritz, Matthew Frank
ECOOP
1998
Springer
15 years 11 months ago
Wrappers to the Rescue
Wrappers are mechanisms for introducing new behavior that is executed before and/or after, and perhaps even in lieu of, an existing method. This paper examines several ways to impl...
John Brant, Brian Foote, Ralph E. Johnson, Don Rob...
FOCS
1997
IEEE
15 years 11 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
« Prev « First page 1348 / 1745 Last » Next »