Sciweavers

844 search results - page 94 / 169
» Safraless Decision Procedures
Sort
View
KCAP
2003
ACM
14 years 2 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
14 years 1 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
HASE
1998
IEEE
14 years 1 months ago
Optimal Discrimination between Transient and Permanent Faults
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
M. Pizza, Lorenzo Strigini, Andrea Bondavalli, Fel...
KR
1992
Springer
14 years 26 days ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
RTA
2010
Springer
14 years 20 days ago
Infinitary Rewriting: Foundations Revisited
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
Stefan Kahrs