3780 search results - page 282 / 756 » Algorithms for Game Metrics |
176
click to vote
ACL
2004
15 years 8 months ago
2004
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
205
click to vote
TALG
2008
15 years 7 months ago
2008
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
175
click to vote
TASLP
2008
15 years 7 months ago
2008
The performance of spoken language recognition system is typically formulated to reflect the detection cost and the strategic decision points along the detection-error-tradeoff cur...
192
click to vote
ACSC
2004
IEEE
15 years 11 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
162
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...