5964 search results - page 915 / 1193 » A theory of speculative computation |
184
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
197
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...
162
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...
158
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...
175
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...