4940 search results - page 293 / 988 » On the Complexity of Universal Programs |
157
click to vote
PPPJ
2003
ACM
15 years 12 months ago
2003
ACM
Building distributed systems is an inherently difficult and complex task. Modern middleware architectures assist developers ding abstractions that hide transport layer functionali...
182
click to vote
CHARME
2003
Springer
15 years 12 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
184
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
236
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
198
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...