Sciweavers

388 search results - page 67 / 78
» Discrete Hamilton-Jacobi theory and discrete optimal control
Sort
View
148
Voted
SASO
2009
IEEE
16 years 24 days ago
Self-Organization of Patrolling-Ant Algorithms
—We consider here multi-agent patrolling as the task for a group of agents to repeatedly visit all the cells of a discrete environment. Wagner et al. [1] have introduced patrolli...
Arnaud Glad, Olivier Buffet, Olivier Simonin, Fran...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 6 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 6 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ISLPED
2009
ACM
184views Hardware» more  ISLPED 2009»
16 years 18 days ago
Online work maximization under a peak temperature constraint
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
Thidapat Chantem, Xiaobo Sharon Hu, Robert P. Dick
COMPGEOM
2003
ACM
15 years 11 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk