16666 search results - page 2928 / 3334 » Descriptive and Computational Complexity |
206
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
210
click to vote
C3S2E
2008
ACM
15 years 8 months ago
2008
ACM
Software systems bridge the gap between information processing needs and available computer hardware. As system requirements grow in complexity and hardware evolves, the gap does ...
163
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
The primary target of this work is human-robot collaboration, especially for service robots in complicated application scenarios. Three assumptions and four requirements are ident...
166
click to vote
CCCG
2009
15 years 8 months ago
2009
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
188
click to vote
DAWAK
2010
Springer
15 years 8 months ago
2010
Springer
Spatial data warehouses (SDW) enable analytical multidimensional queries together with spatial analysis. Mainly, three operations are related to SDW query processing performance: (...