Sciweavers

5499 search results - page 284 / 1100
» Generalized Rewrite Theories
Sort
View
ASPLOS
2008
ACM
15 years 9 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
ASPLOS
2008
ACM
15 years 9 months ago
The design and implementation of microdrivers
Device drivers commonly execute in the kernel to achieve high performance and easy access to kernel services. However, this comes at the price of decreased reliability and increas...
Vinod Ganapathy, Matthew J. Renzelmann, Arini Bala...
PASTE
2010
ACM
15 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
IJCAI
1989
15 years 8 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
15 years 7 months ago
Expressive and flexible access to web-extracted data: a keyword-based structured query language
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
Jeffrey Pound, Ihab F. Ilyas, Grant E. Weddell