903 search results - page 107 / 181 » Non-well-founded trees in categories |
177
click to vote
SIGECOM
2006
ACM
16 years 7 days ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
167
click to vote
GROUP
2005
ACM
15 years 12 months ago
2005
ACM
A common problem in chat is that the chat display only reveals the temporal order of the conversation. A better user interface is desired that reveals the logical order of the mes...
198
click to vote
WWW
2005
ACM
15 years 12 months ago
2005
ACM
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
181
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
163
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Self-adaptation of the mutation strengths is a powerful mechanism in evolution strategies (ES), but it can fail. As a consequence premature convergence or ending up in a local opt...