1064 search results - page 23 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
170
Voted
ISPD
1997
ACM
15 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
141
click to vote
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
135
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
150
click to vote
SDM
2009
SIAM
16 years 28 days ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
125
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...