3406 search results - page 195 / 682 » Computational models of classical conditioning |
138
click to vote
ERSHOV
2009
Springer
15 years 11 months ago
2009
Springer
One of the applications of supercompilation is proving properties
of programs.We focus in this paper on a speci c task: proving term
equivalence for a higher-order lazy functiona...
135
click to vote
FROCOS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
157
Voted
ADCM
2007
15 years 5 months ago
2007
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
147
click to vote
MP
2006
15 years 5 months ago
2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...
166
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...