Sciweavers

182 search results - page 8 / 37
» Some problems with the notion of context-aware computing
Sort
View
PODS
1999
ACM
153views Database» more  PODS 1999»
15 years 1 months ago
Consistent Query Answers in Inconsistent Databases
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 4 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
ICS
2010
Tsinghua U.
15 years 6 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
KR
2010
Springer
15 years 2 months ago
I Don't Want to Think About it Now: Decision Theory with Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 1 months ago
I Don't Want to Think About it Now:Decision Theory With Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern, Rafael Pass