4894 search results - page 689 / 979 » The Guarding Problem - Complexity and Approximation |
135
click to vote
SIGGRAPH
1992
ACM
15 years 6 months ago
1992
ACM
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
102
Voted
ICS
1989
Tsinghua U.
15 years 6 months ago
1989
Tsinghua U.
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
124
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
90
Voted
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
In this work, we consider the problem of particle source identification from distributed electron density measurements in fusion plasmas, such as the ones obtained in Tore Supra t...
115
Voted
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...