Sciweavers

3771 search results - page 306 / 755
» Subobject Transformation Systems
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
15 years 4 months ago
Termination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
Felix Schernhammer, Bernhard Gramlich
SMC
2010
IEEE
143views Control Systems» more  SMC 2010»
15 years 2 months ago
Estimating of Bellman function via suboptimal strategies
—The paper concerns approximate dynamic decision making. It deals with solving Bellman equation to obtain the Bellman function via so-called suboptimal strategies. The suboptimal...
Jan Zeman
ACL
2010
15 years 2 months ago
Learning Phrase-Based Spelling Error Models from Clickthrough Data
This paper explores the use of clickthrough data for query spelling correction. First, large amounts of query-correction pairs are derived by analyzing users' query reformula...
Xu Sun, Jianfeng Gao, Daniel Micol, Chris Quirk
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 5 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
15 years 10 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards