1143 search results - page 41 / 229 » Mental models of recursion |
87
Voted
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Recursive estimation or Kalman filtering usually relies on explicit model functions, that directly and explicitly describe the effect of the parameters on the observations. Howeve...
90
Voted
NIPS
1998
15 years 1 months ago
1998
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
110
click to vote
BIRTHDAY
2009
Springer
15 years 1 months ago
2009
Springer
ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions whic...
FMCAD
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
108
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....