542 search results - page 7 / 109 » The Denjoy alternative for computable functions |
MFCS
1994
Springer
15 years 1 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
MST
1998
14 years 9 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
OZCHI
2005
ACM
15 years 3 months ago
2005
ACM
Technology is advancing at a rapid pace, automating many everyday chores in the process, changing the way we perform work and providing various forms of entertainment. Makers of t...
ECSQARU
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...