8669 search results - page 79 / 1734 » Computing matrix representations |
124
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 3 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
133
click to vote
TSMC
2008
15 years 2 months ago
2008
In this paper, we present an extensive study of 3-D face recognition algorithms and examine the benefits of various score-, rank-, and decision-level fusion rules. We investigate f...
179
click to vote
NGC
2010
Springer
14 years 9 months ago
2010
Springer
A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed re...
102
click to vote
AI
1999
Springer
15 years 2 months ago
1999
Springer
Yeap [42] argued that an important basis for computing a cognitive map is the ability to compute and recognise local environments. Although he has demonstrated how such local envi...
129
click to vote
AISC
2008
Springer
15 years 4 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...