Sciweavers

7167 search results - page 643 / 1434
» Answer Set Programming
Sort
View
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
15 years 6 months ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
POPL
2012
ACM
14 years 2 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
ICDE
2008
IEEE
191views Database» more  ICDE 2008»
16 years 7 months ago
An Algebraic Approach to Rule-Based Information Extraction
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
Frederick Reiss, Sriram Raghavan, Rajasekar Krishn...
SAC
2009
ACM
16 years 1 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
Verifying Information Flow Control over Unbounded Processes
Abstract. Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that re...
William R. Harris, Nicholas Kidd, Sagar Chaki, Som...