4894 search results - page 476 / 979 » The Guarding Problem - Complexity and Approximation |
143
Voted
DISOPT
2008
15 years 5 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
177
click to vote
ML
2008
ACM
15 years 5 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
151
click to vote
AAECC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
117
Voted
WINET
2008
15 years 5 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
155
click to vote
MOC
2000
15 years 4 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...