15033 search results - page 143 / 3007 » Complexity Theory and Algorithms |
115
Voted
SODA
1992
ACM
15 years 5 months ago
1992
ACM
123
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
145
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
136
Voted
ARITH
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes the application of high radix redundant CORDIC algorithms to complex logarithmic number system arithmetic. It shows that a CLNS addition can be performed with...
101
click to vote
AAAI
2007
15 years 6 months ago
2007
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...