Sciweavers

4218 search results - page 18 / 844
» Complete sets of cooperations
Sort
View
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
14 years 8 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 2 months ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...
APAL
2005
88views more  APAL 2005»
13 years 7 months ago
Completing pseudojump operators
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
Richard Coles, Rodney G. Downey, Carl G. Jockusch ...
JAIR
2008
104views more  JAIR 2008»
13 years 7 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
CDVE
2005
Springer
144views Visualization» more  CDVE 2005»
14 years 1 months ago
The Construction Management Cooperated with Clients Using a Parametric Information Design Method
This paper presents a new construction management cooperated with clients using a parametric information design method for road construction. This management has been found to be e...
Koichi Aritomi, Ryosuke Shibasaki, Nobuyoshi Yabuk...