2343 search results - page 171 / 469 » Structure and Interpretation of Computer Programs |
121
click to vote
COMPSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
138
click to vote
IWPC
1997
IEEE
15 years 9 months ago
1997
IEEE
Program understanding relates a computer program to the goals and requirements it is designed to accomplish. Understanding techniques that rely only on source code analysis are li...
156
click to vote
JPDC
2010
14 years 12 months ago
2010
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
152
click to vote
IJCAI
2007
15 years 6 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
162
click to vote
ECP
1997
Springer
15 years 9 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...