2950 search results - page 35 / 590 » Computing with Infinitely Many Processes |
ACSC
2008
IEEE
13 years 10 months ago
2008
IEEE
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
DLOG
2009
13 years 6 months ago
2009
Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communit...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
COCOA
2010
Springer
13 years 3 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
NIPS
2007
13 years 10 months ago
2007
Many perceptual processes and neural computations, such as speech recognition, motor control and learning, depend on the ability to measure and mark the passage of time. However, ...