Sciweavers

2766 search results - page 84 / 554
» Algorithms for trigonometric polynomials
Sort
View
108
Voted
CORR
2011
Springer
126views Education» more  CORR 2011»
14 years 4 months ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
110
Voted
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
15 years 6 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
85
Voted
DAC
2009
ACM
16 years 1 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
100
Voted
INFOCOM
2000
IEEE
15 years 5 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
89
Voted
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
15 years 6 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes