1677 search results - page 183 / 336 » On the Completeness of Quantum Computation Models |
154
click to vote
DBISP2P
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The vast majority of the interactions in typical online communities nowadays is between complete strangers. In such settings reputation reporting and trust management mod...
169
click to vote
ASSETS
2007
ACM
15 years 10 months ago
2007
ACM
Computers offer valuable assistance to people with physical disabilities. However designing human-computer interfaces for these users is complicated. The range of abilities is mor...
158
click to vote
FLAIRS
2008
15 years 8 months ago
2008
We are interested in building decision-support software for social welfare case managers. Our model in the form of a factored Markov decision process is so complex that a standard...
168
click to vote
WSC
2007
15 years 8 months ago
2007
Compounding processes, also known as perpetuities, play an important role in many applications; in particular, in time series analysis and mathematical finance. Apart from some s...
141
click to vote
IJCAI
1993
15 years 7 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...