Sciweavers

2436 search results - page 67 / 488
» Comonadic Notions of Computation
Sort
View
EUROCRYPT
2010
Springer
14 years 2 months ago
Partial Fairness in Secure Two-Party Computation
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
S. Dov Gordon, Jonathan Katz
ICSE
1993
IEEE-ACM
14 years 1 months ago
Rule-Based Approach to Computing Module Cohesion
Stevens, Myers, and Constantine introduced the notion of cohesion, an ordinal scale of seven levels that describes the degree to which the actions performed by a module contribute...
Arun Lakhotia
FCS
2006
13 years 11 months ago
From Sequential Processes to Grid Computation
: We introduce an extended model for view-centric reasoning, EVCR, that provides more nsive and flexible abstractions for representing actual concurrency. The theory of Communicati...
Mark Burgin, Marc Smith
AIPS
2009
13 years 10 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
AI
2004
Springer
13 years 9 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne