2766 search results - page 265 / 554 » Algorithms for trigonometric polynomials |
223
click to vote
ISLPED
1996
ACM
15 years 9 months ago
1996
ACM
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
174
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
148
Voted
CP
2006
Springer
15 years 9 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
149
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
133
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...