5995 search results - page 237 / 1199 » Algorithmic Game Theory |
169
click to vote
INLG
2010
Springer
15 years 3 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...
139
Voted
SIGDIAL
2010
15 years 3 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...
168
click to vote
TON
2012
13 years 7 months ago
2012
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
DM
2006
15 years 5 months ago
2006
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
118
click to vote
ISMB
1998
15 years 6 months ago
1998
Astatistical theory of local alignmentalgorithms with gaps is presented. Both the linear and logarithmic phases, as well as the phase transition separating the two phases, are des...