3406 search results - page 120 / 682 » Computational models of classical conditioning |
120
click to vote
CCA
2005
Springer
15 years 10 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
169
click to vote
PE
2010
Springer
14 years 11 months ago
2010
Springer
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
120
click to vote
AI
2005
Springer
15 years 10 months ago
2005
Springer
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
141
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
135
click to vote
GRC
2008
IEEE
15 years 5 months ago
2008
IEEE
Preference analysis is a class of important tasks in multi-criteria decision making. The classical rough set theory was generalized to deal with preference analysis by replacing e...