3134 search results - page 34 / 627 » Computing full disjunctions |
TCC
2010
Springer
15 years 10 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
128
click to vote
TOG
2012
13 years 4 months ago
2012
We present a physically-based analytical model of the daytime sky. Based on the results of a first-principles brute force simulation of radiative transfer in the atmosphere, we u...
145
click to vote
DALT
2009
Springer
15 years 5 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
106
click to vote
AUSAI
1999
Springer
15 years 6 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
118
click to vote
WWW
2001
ACM
16 years 2 months ago
2001
ACM
The simplicity of the basic client/server model of Web services led quickly to its widespread adoption, but also to scalability and performance problems. The technological respons...