Sciweavers

5608 search results - page 218 / 1122
» On the Theory of Matchgate Computations
Sort
View
AAAI
2008
15 years 9 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 8 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
NAACL
1994
15 years 8 months ago
Automatic Evaluation of Computer Generated Text: A Progress Report on the TEXTEVAL Project
We present results ofexperiments designed to assess the usefulness of a new technique for the evaluation of translation quality, comparing human rankings with automatic measures. ...
Chris Brew, Henry S. Thompson
ENTCS
2008
87views more  ENTCS 2008»
15 years 6 months ago
Integral of Fine Computable functions and Walsh Fourier series
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii
FUIN
2010
158views more  FUIN 2010»
15 years 4 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner