Sciweavers

5675 search results - page 171 / 1135
» Exploiting Chaos for Computation
Sort
View
204
Voted
HICSS
2003
IEEE
164views Biometrics» more  HICSS 2003»
15 years 10 months ago
From Computer Networks to Agent Networks
From the 1990s on, one of the most important challenges facing computer science researchers has been the design and construction of software tools to exploit Internet computing. A...
Guoqiang Zhong, Kenichi Takahashi, Satoshi Amamiya...
IPPS
2002
IEEE
15 years 9 months ago
Architecture of the Entropia Distributed Computing System
Distributed Computing, the exploitation of idle cycles on pervasive desktop PC systems offers the opportunity to increase the available computing power by orders of magnitude (10x...
Andrew A. Chien
152
Voted
WOMPAT
2001
Springer
15 years 9 months ago
OmniRPC: A Grid RPC Facility for Cluster and Global Computing in OpenMP
d Abstract) Mitsuhisa Sato1 , Motonari Hirano2 , Yoshio Tanaka2 , and Satoshi Sekiguchi2 1 Real World Computing Partnership, Tsukuba, Japan 2 Software Research Associates, Inc 3 El...
Mitsuhisa Sato, Motonori Hirano, Yoshio Tanaka, Sa...
SPIRE
2000
Springer
15 years 8 months ago
Virtual Test Tubes: A New Methodology for Computing
Biomolecular computing (BMC) aims to capture the innumerable advantages that biological molecules have gained in the course of millions of years of evolution to perform computatio...
Max H. Garzon, Evan Drumwright, Russell J. Deaton,...
132
Voted
CGF
2008
153views more  CGF 2008»
15 years 4 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm