95 search results - page 14 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
WOB
2008
13 years 10 months ago
2008
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
ESORICS
2010
Springer
13 years 10 months ago
2010
Springer
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID priv...
SMA
2008
ACM
13 years 8 months ago
2008
ACM
Robust Statistics considers the quality of statistical decisions in the presence of deviations from the ideal model, where deviations are modelled by neighborhoods of a certain siz...
RTA
2010
Springer
14 years 21 days ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
ICCAD
2006
IEEE
14 years 5 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...