2542 search results - page 372 / 509 » Computing Cartograms with Optimal Complexity |
IEEEPACT
2005
IEEE
14 years 3 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
In many scientific domains, researchers are turning to large-scale behavioral simulations to better understand real-world phenomena. While there has been a great deal of work on s...
TCSV
2010
13 years 5 months ago
2010
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
IPPS
1997
IEEE
14 years 1 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...