Sciweavers

2766 search results - page 425 / 554
» Algorithms for trigonometric polynomials
Sort
View
ECRTS
2000
IEEE
15 years 8 months ago
Early-release fair scheduling
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...
James H. Anderson, Anand Srinivasan
CP
1997
Springer
15 years 8 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
DAC
1996
ACM
15 years 8 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 8 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
FSTTCS
1993
Springer
15 years 8 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...