4940 search results - page 604 / 988 » On the Complexity of Universal Programs |
293
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
277
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
178
click to vote
ICSE
2004
IEEE-ACM
2004
IEEE-ACM
Automated Support for Development, Maintenance, and Testing in the Presence of Implicit Control Flow
16 years 6 months ago
Although object-oriented languages can improve programming practices, their characteristics may introduce new problems for software engineers. One important problem is the presenc...
179
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
177
click to vote
KCAP
2009
ACM
16 years 1 months ago
2009
ACM
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...