2542 search results - page 75 / 509 » Computing Cartograms with Optimal Complexity |
123
Voted
DC
2007
15 years 2 months ago
2007
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive a...
120
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper evaluates a parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of...
119
Voted
SMA
2006
ACM
15 years 8 months ago
2006
ACM
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
124
Voted
RSS
2007
15 years 4 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
152
Voted
JMLR
2010
14 years 9 months ago
2010
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...