Sciweavers

922 search results - page 180 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
ICS
2010
Tsinghua U.
13 years 11 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
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
FORMATS
2006
Springer
13 years 11 months ago
A Dose of Timed Logic, in Guarded Measure
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
Kamal Lodaya, Paritosh K. Pandya
FQAS
2006
Springer
186views Database» more  FQAS 2006»
13 years 11 months ago
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Jef Wijsen