1224 search results - page 175 / 245 » Theory decision by decomposition |
PLANX
2008
15 years 2 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
113
Voted
AAAI
2004
15 years 2 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
84
Voted
CISST
2003
15 years 2 months ago
2003
An approach to conflation/registration of images that does not depend on identifying common points is being developed. It uses the method of algebraic invariants to provide a comm...
104
click to vote
FLAIRS
2003
15 years 2 months ago
2003
Data mining is the process of extracting implicit, previously unknown, and potentially useful information from data in databases. It is widely recognized as a useful tool for deci...
127
click to vote
NIPS
2001
15 years 2 months ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...