2542 search results - page 100 / 509 » Computing Cartograms with Optimal Complexity |
132
click to vote
IEEEPACT
2000
IEEE
15 years 7 months ago
2000
IEEE
Region-based compilation repartitions a program into more desirable compilation units for optimization and scheduling, particularly beneficial for ILP architectures. With region-...
136
click to vote
COMPGEOM
1998
ACM
15 years 7 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
119
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
102
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
76
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...