1557 search results - page 44 / 312 » Programming up to Congruence |
ICML
2008
IEEE
15 years 12 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
IISWC
2006
IEEE
15 years 5 months ago
2006
IEEE
The load instructions of some of the bioinformatics applications in the BioPerf suite possess interesting characteristics: only a few static loads cover almost the entire dynamic ...
113
click to vote
FIDJI
2003
Springer
15 years 4 months ago
2003
Springer
— We present techniques for analyzing the source code of distributed Java applications, and building finite models of their behaviour. The models are labelled transition systems...
94
Voted
CIAC
1997
Springer
15 years 3 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
100
click to vote
ICLP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...