Sciweavers

889 search results - page 5 / 178
» Problems in Rewriting III
Sort
View
RTA
2005
Springer
14 years 3 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
ICDT
2001
ACM
162views Database» more  ICDT 2001»
14 years 2 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
CORR
1998
Springer
75views Education» more  CORR 1998»
13 years 9 months ago
The Complexity of Planar Counting Problems
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Ra...