16430 search results - page 333 / 3286 » On Computable Tree Functions |
156
click to vote
FSTTCS
2000
Springer
15 years 8 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
163
click to vote
PAAPP
1998
15 years 4 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
151
click to vote
PVM
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this work we present two algorithms of irregular scatter/gather operations based on the binomial tree and Tr¨aff algorithms. We use the prediction provided by hetero...
150
Voted
FUIN
2010
15 years 2 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
122
Voted
COLING
2010
14 years 12 months ago
2010
We propose a structure called dependency forest for statistical machine translation. A dependency forest compactly represents multiple dependency trees. We develop new algorithms ...