2018 search results - page 235 / 404 » Code Normal Forms |
112
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
110
click to vote
PERCOM
2004
ACM
16 years 1 months ago
2004
ACM
Sleep deprivation attacks are a form of denial of service attack whereby an attacker renders a pervasive computing device inoperable by draining the battery more quickly than it w...
POPL
2010
ACM
15 years 11 months ago
2010
ACM
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...
118
click to vote
ICCAD
2001
IEEE
15 years 11 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
119
click to vote
PADL
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study a number of embedded DSLs for autonomous ordinary differential equations (autonomous ODEs) in Haskell. A naive implementation based on the lazy tower of derivat...