5404 search results - page 975 / 1081 » Global Computing for Bioinformatics |
131
click to vote
HPDC
1999
IEEE
15 years 8 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
126
click to vote
BIRTHDAY
1997
Springer
15 years 8 months ago
1997
Springer
The structures of space and time are identified as essential for the realization of cognitive systems. It is suggested that the omnipresence of space and time may have been respons...
163
click to vote
PCRCW
1997
Springer
15 years 8 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
143
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
151
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...