Sciweavers

3780 search results - page 129 / 756
» Algorithms for Game Metrics
Sort
View
96
Voted
COMSIS
2010
14 years 10 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
15 years 7 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
119
Voted
ATAL
2007
Springer
15 years 6 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
ICANN
2005
Springer
15 years 6 months ago
Evolution of Heuristics for Give-Away Checkers
The efficacy of two evolutionary approaches to the problem of generation of heuristical linear and non-linear evaluation functions in the game of give-away checkers is tested in th...
Magdalena Kusiak, Karol Waledzik, Jacek Mandziuk
WCRE
1999
IEEE
15 years 4 months ago
MoJo: A Distance Metric for Software Clusterings
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
Vassilios Tzerpos, Richard C. Holt