4036 search results - page 599 / 808 » Formal Methods |
200
click to vote
UAI
2000
15 years 7 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
176
click to vote
ESOP
2004
Springer
15 years 12 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
150
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper investigates reinforcement learning (RL) in XCS. First, it formally shows that XCS implements a method of generalized RL based on linear approximators, in which the usu...
177
click to vote
JCS
2010
15 years 1 months ago
2010
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
301
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...