Sciweavers

2040 search results - page 17 / 408
» On the Complexity of Error Explanation
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
STACS
1993
Springer
13 years 11 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
MT
1998
56views more  MT 1998»
13 years 7 months ago
Translation Differences and Pragmatics-Based MT
: This paper examines differences between two professional translations into English of the same Spanish newspaper article. Among other explanations for these differences, such as ...
Stephen Helmreich, David Farwell
DIS
2003
Springer
14 years 28 days ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
WSC
2008
13 years 10 months ago
Applying causal inference to understand emergent behavior
Emergent behaviors in simulations require explanation, so that valid behaviors can be separated from design or coding errors. Validation of emergent behavior requires accumulation...
Ross Gore, Paul F. Reynolds Jr.