742 search results - page 8 / 149 » Classical conditioning |
200
Voted
ICML
2004
IEEE
16 years 25 days ago
2004
IEEE
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
214
Voted
ETFA
2006
IEEE
15 years 11 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
153
Voted
FLAIRS
2008
15 years 9 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
163
Voted
ICCSA
2003
Springer
16 years 19 days ago
2003
Springer
Abstract. In this paper, we consider a nonlinear optimization problem with inequality constraints. The paper addresses the degenerate case when the active constraint gradients are ...
193
Voted
FEGC
2008
15 years 8 months ago
2008
We propose a novel algorithm for extracting the structure of a Bayesian network from a dataset. Our approach is based on generalized conditional entropies, a parametric family of e...