3038 search results - page 513 / 608 » High-Speed Function Approximation |
160
click to vote
AAAI
2007
15 years 6 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
139
click to vote
AIPS
2008
15 years 6 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
130
click to vote
AIPS
2008
15 years 6 months ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
156
click to vote
ANNPR
2008
Springer
15 years 6 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
139
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In modern circuit design, it is difficult to provide reliable parametric yield prediction since the real distribution of process data is hard to measure. Most existing approaches ...