4894 search results - page 252 / 979 » The Guarding Problem - Complexity and Approximation |
171
click to vote
ATAL
2007
Springer
16 years 23 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
156
click to vote
MOC
2002
15 years 6 months ago
2002
We study the dynamical behavior of the discontinuous Galerkin finite element method for initial value problems in ordinary differential equations. We make two different assumptions...
268
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
167
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
231
click to vote
ESANN
2000
15 years 8 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...