742 search results - page 2 / 149 » Classical conditioning |
WCE
2007
13 years 7 months ago
2007
–We consider the boundary value problem: x(m) (t) = f(t, x(t)), a ≤ t ≤ b, m > 1 x(a) = β0 ∆x(k) ≡ x(k) (b) − x(k) (a) = βk+1, k = 0, ..., m − 2 wher...
SCHOLARPEDIA
2008
13 years 5 months ago
2008
ECAI
2006
Springer
13 years 10 months ago
2006
Springer
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
SYNTHESE
2010
13 years 4 months ago
2010
Throughout more than two millennia philosophers adhered massively to ideal standards of scientific rationality going back ultimately to Aristotle’s Analytica posteriora. These s...
JCT
2011
13 years 1 months ago
2011
We give combinatorial proofs of the formulas for the number of multichains in the k-divisible noncrossing partitions of classical types with certain conditions on the rank and the ...