3406 search results - page 500 / 682 » Computational models of classical conditioning |
136
click to vote
LICS
2003
IEEE
15 years 10 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
170
click to vote
CSL
2003
Springer
15 years 10 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
160
click to vote
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, product structure is taken as knowledge acquisition point, and the effective knowledge acquisition path is discussed by establishing the associated relationship bet...
136
click to vote
AIMSA
2000
Springer
15 years 9 months ago
2000
Springer
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
186
click to vote
DDECS
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...