Sciweavers

6355 search results - page 1200 / 1271
» From Logic to Games
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
15 years 6 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
JAIR
2008
148views more  JAIR 2008»
15 years 6 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
15 years 6 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
15 years 6 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
AC
2005
Springer
15 years 6 months ago
The state of artificial intelligence
Artificial intelligence has been an active branch of research for computer scientists and psychologists for 50 years. The concept of mimicking human intelligence in a computer fue...
Adrian A. Hopgood
« Prev « First page 1200 / 1271 Last » Next »