Sciweavers

5995 search results - page 191 / 1199
» Algorithmic Game Theory
Sort
View
EMMCVPR
2001
Springer
15 years 8 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
CE
2008
99views more  CE 2008»
15 years 2 months ago
Designing multimedia games for young children's taxonomic concept development
This study aimed to design and evaluate multimedia games which were based on the theories of children's development of taxonomic concepts. Factors that might affect children&...
Yao-Ting Sung, Kuo-En Chang, Meng-Da Lee
FSTTCS
2000
Springer
15 years 7 months ago
Dynamically Ordered Probabilistic Choice Logic Programming
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, D...
Marina De Vos, Dirk Vermeir
DIGRA
2003
Springer
15 years 9 months ago
Ka as shomin-geki: Problematizing videogame studies
The paper addresses limitations of strictly interactive theories of videogame genre, proposes a supplementary, historicist inter-media alternative, and interprets the videogame Ka...
William Huber
RSKT
2009
Springer
15 years 8 months ago
A Time-Reduction Strategy to Feature Selection in Rough Set Theory
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
Hongxing Chen, Yuhua Qian, Jiye Liang, Wei Wei, Fe...