4435 search results - page 364 / 887 » Algorithms, games, and the internet |
175
click to vote
OTM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can int...
239
click to vote
WEBI
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we propose a Relation Expansion framework, which uses a few seed sentences marked up with two entities to expand a set of sentences containing target relations. Duri...
193
click to vote
ICDCIT
2004
Springer
16 years 1 months ago
2004
Springer
We focus on the problem of distributing key updates in secure dynamic groups. Due to changes in group membership, the group controller needs to change and distribute the keys used...
224
click to vote
ML
2006
ACM
15 years 7 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
219
click to vote
AAAI
2012
13 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...