425 search results - page 38 / 85 » On the additive constant of the k-server Work Function Algor... |
114
Voted
TCAD
1998
15 years 3 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
137
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
154
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
122
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
138
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...