973 search results - page 43 / 195 » New Bounds on Crossing Numbers |
111
click to vote
CP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
—Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions signiï...
106
click to vote
RTSS
2006
IEEE
15 years 5 months ago
2006
IEEE
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
101
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
Uncertainty is a key issue in decision analysis and other kinds of applications. Researchers have developed a number of approaches to address computations on uncertain quantities....