3406 search results - page 111 / 682 » Computational models of classical conditioning |
146
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
Modeling the performance behavior of parallel applications to predict the execution times of the applications for larger problem sizes and number of processors has been an active ...
137
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
137
click to vote
CSB
2005
IEEE
15 years 10 months ago
2005
IEEE
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many of them have adopted matrix norms to define the similarity score of a bicluste...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
169
click to vote
JAIR
2012
13 years 6 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...