1686 search results - page 109 / 338 » Programs as polygraphs: computability and complexity |
121
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
184
click to vote
META
1992
15 years 7 months ago
1992
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
131
click to vote
AIPS
2007
15 years 5 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...
173
click to vote
CCE
2008
15 years 3 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
160
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...