19866 search results - page 352 / 3974 » Computing all factorizations in *** |
159
click to vote
PODC
2004
ACM
16 years 6 days ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
180
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
280
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
214
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
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,...
237
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
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,...