4940 search results - page 235 / 988 » On the Complexity of Universal Programs |
190
click to vote
LOPSTR
1997
Springer
15 years 10 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
177
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for represen...
164
click to vote
AROBOTS
2004
15 years 6 months ago
2004
We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are d...
214
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
138
click to vote
AHS
2007
IEEE
16 years 27 days ago
2007
IEEE
This paper reviews the current state of the art in highperformance reconfigurable computing (HPRC) from the perspective of EPCC, the high-performance computing centre at the Unive...