3455 search results - page 455 / 691 » Generalized Game Trees |
166
click to vote
TOMS
2010
15 years 5 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
183
Voted
WALCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
213
click to vote
DMTCS
2010
15 years 4 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
176
click to vote
AAAI
2011
14 years 6 months ago
2011
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
226
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...