Sciweavers

9284 search results - page 1722 / 1857
» Knowledge State Algorithms
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 8 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
ECIR
2008
Springer
15 years 7 months ago
Clustering Template Based Web Documents
More and more documents on the World Wide Web are based on templates. On a technical level this causes those documents to have a quite similar source code and DOM tree structure. G...
Thomas Gottron
COLING
1992
15 years 7 months ago
Learning Translation Templates From Bilingual Text
This paper proposes a two-phase example-based machine translation methodology which develops translation templates from examples and then translates using template matching. This ...
Hiroyuki Kaji, Yuuko Kida, Yasutsugu Morimoto
SWAP
2007
15 years 7 months ago
UFOme: A User Friendly Ontology Mapping Environment
Recently the Ontology Mapping Problem (OMP) has been identified as a key factor towards the success of the Semantic Web and related applications. This problem arises since it is po...
Giuseppe Pirrò, Domenico Talia
ATAL
2010
Springer
15 years 7 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
« Prev « First page 1722 / 1857 Last » Next »