Sciweavers

428 search results - page 40 / 86
» Completeness of a Fact Extractor
Sort
View
DAC
2009
ACM
16 years 26 days ago
Improving testability and soft-error resilience through retiming
State elements are increasingly vulnerable to soft errors due to their decreasing size, and the fact that latched errors cannot be completely eliminated by electrical or timing ma...
Smita Krishnaswamy, Igor L. Markov, John P. Hayes
WWW
2008
ACM
16 years 16 days ago
Querying for meta knowledge
The Semantic Web is based on accessing and reusing RDF data from many different sources, which one may assign different levels of authority and credibility. Existing Semantic Web ...
Bernhard Schueler, Sergej Sizov, Steffen Staab, Du...
CHI
2008
ACM
16 years 7 days ago
Articulating common ground in cooperative work: content and process
We study the development of common ground in an emergency management planning task. Twelve three-person multi-role teams performed the task with a paper prototype in a controlled ...
Gregorio Convertino, Helena M. Mentis, Mary Beth R...
CADE
2005
Springer
16 years 4 days ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
16 years 4 days ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous