Sciweavers

1448 search results - page 89 / 290
» Restricted Stack Implementations
Sort
View
CTRS
1992
13 years 11 months ago
Path Orderings for Termination of Associative-Commutative Rewriting
We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the "binary path condition," sufficesfor establishing terminat...
Nachum Dershowitz, Subrata Mitra
AUTOMATICA
2008
104views more  AUTOMATICA 2008»
13 years 7 months ago
Exact finite approximations of average-cost countable Markov decision processes
For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...
Arie Leizarowitz, Adam Shwartz
ENTCS
2010
110views more  ENTCS 2010»
13 years 5 months ago
Formalizing Homogeneous Language Embeddings
The cost of implementing syntactically distinct Domain Specific Languages (DSLs) can be reduced by homogeneously embedding them in a host language in cooperation with its compiler...
Tony Clark, Laurence Tratt
AUSAI
1998
Springer
13 years 12 months ago
cardTAP: Automated Deduction on a Smart Card
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
Andrew Slater, Rajeev Goré, Joachim Posegga...
FIMI
2004
134views Data Mining» more  FIMI 2004»
13 years 9 months ago
Recursion Pruning for the Apriori Algorithm
Implementations of the well-known Apriori algorithm for finding frequent item sets and associations rules usually rely on a doubly recursive scheme to count the subsets of a given...
Christian Borgelt