350 search results - page 44 / 70 » Complexity of Planning with Partial Observability |
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
This paper reports on a study of semantic role tagging in Chinese, in the absence of a parser. We investigated the effect of using only lexical information in statistical training;...
KR
1989
Springer
13 years 12 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
FLAIRS
2010
13 years 10 months ago
2010
Dynamic changes in complex, real-time environments, such as modern video games, can violate an agent's expectations. We describe a system that responds competently to such vi...