4940 search results - page 196 / 988 » On the Complexity of Universal Programs |
142
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
256
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
150
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
143
click to vote
BPM
2007
Springer
16 years 13 days ago
2007
Springer
Reference Models comprise information on best or common practices for reuse. However, they commonly originate from individual projects. Yet, project models are usually situational ...
158
click to vote
CSEE
2007
Springer
16 years 13 days ago
2007
Springer
Many university classes and commercial training courses rely on classroom lecture and practice exercises to help students learn new skills. The thesis work described in this paper...