810 search results - page 148 / 162 » Solving Time-Dependent Planning Problems |
JMLR
2010
13 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
W2GIS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
IPPS
2002
IEEE
14 years 24 days ago
2002
IEEE
Abstract— In this paper, we present a novel and comprehensive resource management solution for the autonomous hot-spot convergence system (AHSCS) that uses sensor web. This solut...
CDC
2009
IEEE
14 years 18 days ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
EUROSYS
2010
ACM
14 years 2 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...