3406 search results - page 380 / 682 » Computational models of classical conditioning |
206
click to vote
GRAMMARS
1998
15 years 6 months ago
1998
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
206
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Models of bags of words typically assume topic mixing so that the words in a single bag come from a limited number of topics. We show here that many sets of bag of words exhibit a...
172
click to vote
VLSID
2009
IEEE
16 years 7 months ago
2009
IEEE
We present the automatic test pattern generator TIGUAN based on a thread-parallel SAT solver. Due to a tight integration of the SAT engine into the ATPG algorithm and a carefully ...
145
click to vote
ATAL
2007
Springer
16 years 25 days ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
145
click to vote
CSR
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we consider the decidability of two problems related to information flow in a system with respect to some property. A flow occurs in a system if the conditional pr...