Sciweavers

1653 search results - page 205 / 331
» Computer science and game theory
Sort
View
ICSE
2003
IEEE-ACM
15 years 11 months ago
Using Benchmarking to Advance Research: A Challenge to Software Engineering
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
72
Voted
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 4 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
73
Voted
CCA
2005
Springer
15 years 4 months ago
Representing Probability Measures using Probabilistic Processes
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
Matthias Schröder, Alex K. Simpson
92
Voted
ICALP
2007
Springer
15 years 5 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
ICALP
2005
Springer
15 years 4 months ago
Decidability in Syntactic Control of Interference
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
James Laird