3455 search results - page 182 / 691 » Generalized Game Trees |
236
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
185
click to vote
FOIKS
2010
Springer
16 years 1 months ago
2010
Springer
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
166
click to vote
AAAI
2006
15 years 8 months ago
2006
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
136
click to vote
EOR
2010
15 years 6 months ago
2010
Cooperation structures without any a priori assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for marginal values, cores and conve...
132
click to vote
MOBIDE
2009
ACM
16 years 1 months ago
2009
ACM
×Ù ÐØ × Ò Ñ Ö Ò
Ý × ØÙ Ø ÓÒ× Ö Ó Ø Ò
Ù× Ý Ô Ò Ò Ò
× × Û Ö Ù Ð Ò Ú
Ù Ø ÓÒ × Ö ÕÙ Ö ¸ Ø Ý Ö Ó Ø Ò
Ù× Ý ×ÓÖ Ò Þ Ú ...