Sciweavers

4744 search results - page 526 / 949
» Connected Computing
Sort
View
GCC
2007
Springer
16 years 1 months ago
Detecting and Reducing Partition Nodes in Limited-routing-hop Overlay Networks
Many Internet applications use overlay networks as their basic facilities, like resource sharing, collaborative computing, and so on. Considering the communication cost, most over...
Zhenhua Li, Guihai Chen
IPPS
1998
IEEE
15 years 11 months ago
Optimizing Parallel Applications for Wide-Area Clusters
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter ...
GECCO
2000
Springer
200views Optimization» more  GECCO 2000»
15 years 10 months ago
Chemical Crossover
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
Hugues Bersini
CSUR
2004
91views more  CSUR 2004»
15 years 7 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
AINA
2008
IEEE
16 years 1 months ago
Parameterless Broadcasting in Static to Highly Mobile Wireless Ad Hoc, Sensor and Actuator Networks
—In a broadcasting task, source node wants to send the same message to all the other nodes in the network. Existing solutions range from connected dominating set (CDS) based for ...
Adnan Afsar Khan, Ivan Stojmenovic, Nejib Zaguia