5608 search results - page 888 / 1122 » On the Theory of Matchgate Computations |
186
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
154
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
153
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
: A persuasion dialog is a dialog in which agents exchange arguments on a subject. In this kind of dialog, the agents disagree about the status of the subject and each one tries to...
168
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
153
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...