63 search results - page 13 / 13 » Boolean Functions for Finite-Tree Dependencies |
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
ISORC
2003
IEEE
14 years 22 days ago
2003
IEEE
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by ...