15033 search results - page 239 / 3007 » Complexity Theory and Algorithms |
150
click to vote
UAI
2001
15 years 6 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
153
click to vote
INLG
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we present a reference generation model based on Reference Domain Theory which gives a dynamic account of reference. This reference model assumes that each referring...
128
click to vote
SIGDIAL
2010
15 years 2 months ago
2010
In this paper we present a reference model based on Reference Domain Theory that can work both in interpretation and generation. We introduce a formalization of key concepts of RD...
146
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
127
click to vote
ICFCA
2007
Springer
15 years 10 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...