Sciweavers

5964 search results - page 166 / 1193
» A theory of speculative computation
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 4 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
16 years 1 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...
159
Voted
ATAL
2007
Springer
16 years 1 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
ADC
2007
Springer
164views Database» more  ADC 2007»
16 years 1 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
159
Voted
CORR
1998
Springer
85views Education» more  CORR 1998»
15 years 6 months ago
The Proper Treatment of Optimality in Computational Phonology
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994, the n...
Lauri Karttunen