Sciweavers

3713 search results - page 323 / 743
» Quantum Information Theory
Sort
View
IJAR
2008
129views more  IJAR 2008»
15 years 1 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...
IPL
2006
92views more  IPL 2006»
15 years 29 days ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 27 days ago
Cubic Monomial Bent Functions: A Subclass of M
Based on a computer search, Anne Canteaut conjectured that the exponent 22r +2r + 1 in F26r and the exponent (2r + 1)2 in F24r yield bent monomial functions. These conjectures are ...
Pascale Charpin, Gohar M. M. Kyureghyan
110
Voted
CSL
2002
Springer
15 years 24 days ago
A conversation acts model for generating spoken dialogue contributions
In this paper, we describe a generation system for spoken dialogue that not only produces coherent, informative and responsive dialogue contributions, but also explicitly models h...
Amanda Stent
TCS
2002
15 years 19 days ago
A comparison of two approaches to pseudorandomness
The concept of pseudorandomness plays an important role in cryptography. In this note, we contrast the notions of complexity-theoretic pseudorandom strings (from algorithmic infor...
Yongge Wang