4342 search results - page 154 / 869 » Improved Algorithms for Optimal Embeddings |
140
Voted
SODA
1994
ACM
15 years 5 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
131
click to vote
CORR
1998
Springer
15 years 4 months ago
1998
Springer
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
117
click to vote
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper addresses the issue of timing driven gate duplication for delay optimization. Gate duplication has been used extensively for cutset minimization but the usefulness in m...
117
click to vote
JCSS
2008
15 years 4 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
136
Voted
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many appl...