14779 search results - page 2774 / 2956 » On Ultrametric Algorithmic Information |
141
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
153
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
125
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...
142
click to vote
BIRD
2008
Springer
15 years 6 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
138
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...