3780 search results - page 212 / 756 » Algorithms for Game Metrics |
157
Voted
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
178
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper introduces a metric that measures symmetry in tree graphs, which allows for a statistical characterization of GP solutions by their architectural "shapes." A ...
181
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
155
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
171
Voted
FSTTCS
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...