Sciweavers

1675 search results - page 297 / 335
» The Value of a Good Name
Sort
View
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 10 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
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
13 years 10 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu
AAAI
2006
13 years 10 months ago
Using an Ontology for Knowledge Acquisition
We describe an approach to distributed knowledge acquisition using an ontology. The ontology is used to represent and reason about soldier performance. These methods are embedded ...
Stacy Lovell, Webb Stacy
AIPS
2004
13 years 10 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
ESANN
2004
13 years 10 months ago
Forbidden magnification? II
The twin of this paper, "Forbidden Magnification? I." [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann ...
Erzsébet Merényi, Abha Jain