3946 search results - page 174 / 790 » The computational complexity of choice sets |
171
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized ...
166
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
132
click to vote
GRID
2005
Springer
16 years 3 days ago
2005
Springer
— QoS and congestion performance are crucial to good application performance in a utility computing environment. Unfortunately, proper IP QoS setup is very complex and is either ...
156
click to vote
ISAAC
2005
Springer
16 years 3 days ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
171
click to vote
CASC
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...