2542 search results - page 30 / 509 » Computing Cartograms with Optimal Complexity |
CEC
2007
IEEE
13 years 7 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
ACMMSP
2005
ACM
14 years 1 months ago
2005
ACM
In this work we investigate the impact of evolving memory system features, such as large on-chip caches, automatic prefetch, and the growing distance to main memory on 3D stencil ...
GCC
2003
Springer
14 years 26 days ago
2003
Springer
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
CVIU
2008
13 years 7 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...