14699 search results - page 370 / 2940 » Complexity and Cognitive Computing |
246
click to vote
ICAART
2010
INSTICC
16 years 1 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
128
click to vote
ASAP
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
154
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and ascending manifolds of all critical points. In the generic case, its ...
118
click to vote
COCO
1989
Springer
15 years 9 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
123
click to vote
LREC
2008
15 years 6 months ago
2008
We present a corpus of spoken dialogues between students and an adaptive Wizard-of-Oz tutoring system, in which student uncertainty was manually annotated in real-time. We detail ...