4940 search results - page 580 / 988 » On the Complexity of Universal Programs |
150
click to vote
AIPS
2006
15 years 8 months ago
2006
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
111
click to vote
COLING
1994
15 years 8 months ago
1994
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...
149
click to vote
UAI
1996
15 years 8 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
156
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
201
click to vote
HRI
2010
ACM
15 years 7 months ago
2010
ACM
In this paper a system, which is driven through natural language, that allows operators to select and manipulate objects in the environment using an industrial robot is proposed. I...