Sciweavers

5608 search results - page 143 / 1122
» On the Theory of Matchgate Computations
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 11 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, ...
RTA
2009
Springer
15 years 8 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...
ATAL
2007
Springer
15 years 8 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
130
Voted
ADC
2007
Springer
164views Database» more  ADC 2007»
15 years 8 months ago
Computer Assisted Assessment of SQL Query Skills
Structured Query Language (SQL) is the dominant language for querying relational databases today, and is an essential topic in introductory database courses in higher education. E...
Stijn Dekeyser, Michael de Raadt, Tien Yu Lee
FOSSACS
1998
Springer
15 years 6 months ago
Generalizing Domain Theory
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
Michael W. Mislove