2542 search results - page 89 / 509 » Computing Cartograms with Optimal Complexity |
155
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
139
click to vote
DAC
2000
ACM
16 years 4 months ago
2000
ACM
A main advantage of control composition with modal processes [4] is the enhanced retargetability of the composed behavior over a wide variety of target architectures. Unlike previ...
121
click to vote
CLUSTER
2008
IEEE
15 years 9 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
148
click to vote
PEPM
2000
ACM
15 years 6 months ago
2000
ACM
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
115
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...