Sciweavers

3172 search results - page 37 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ENTCS
2010
118views more  ENTCS 2010»
14 years 10 months ago
Systematic Refinement of Performance Models for Concurrent Component-based Systems
Model-driven performance prediction methods require detailed design models to evaluate the performance of software systems during early development stages. However, the complexity...
Lucia Kapová, Steffen Becker
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
15 years 6 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
TARK
2007
Springer
15 years 6 months ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
102
Voted
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 10 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
90
Voted
LPNMR
2005
Springer
15 years 6 months ago
Guarded Open Answer Set Programming
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir