2588 search results - page 311 / 518 » Applications of Kolmogorov complexity to computable model th... |
219
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
171
click to vote
SLP
1993
15 years 8 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
178
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
180
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
161
click to vote
ICPADS
2007
IEEE
16 years 28 days ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...