3406 search results - page 16 / 682 » Computational models of classical conditioning |
ICEIS
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
MP
2006
13 years 8 months ago
2006
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
GMP
2010
IEEE
14 years 14 hour ago
2010
IEEE
In this paper, we present a method for constructing Loop’s subdivision surface patches with given G1 boundary conditions and a given topology of control polygon of the subdivisi...
ANOR
2002
13 years 8 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...