2542 search results - page 102 / 509 » Computing Cartograms with Optimal Complexity |
132
click to vote
SMA
2010
ACM
15 years 3 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
159
Voted
AI
2009
Springer
15 years 10 months ago
2009
Springer
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
114
Voted
VIIP
2001
15 years 4 months ago
2001
Graphics cards exercise increasingly more computing power and are highly optimized for high data transfer volumes. In contrast typical workstations perform badly when data exceeds...
129
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
129
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...