824 search results - page 43 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
170
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
ALGORITHMICA
1998
14 years 9 months ago
1998
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
82
Voted
IJCAI
2001
14 years 11 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
JSA
2000
14 years 9 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
129
click to vote
AAIP
2009
14 years 10 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...