336 search results - page 8 / 68 » Program Speedups in Theory and Practice |
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
123
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
154
click to vote
COLT
1994
Springer
15 years 4 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
110
Voted
PLILP
1993
Springer
15 years 4 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
90
Voted
IFIP
2000
Springer
15 years 4 months ago
2000
Springer
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...