Sciweavers

12052 search results - page 2270 / 2411
» computer 2010
Sort
View
AIMSA
2010
Springer
13 years 11 months ago
Towards Ontological Blending
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
Joana Hois, Oliver Kutz, Till Mossakowski, John A....
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 11 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 11 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
ASUNAM
2010
IEEE
13 years 11 months ago
Assessing Expertise Awareness in Resolution Networks
Problem resolution is a key issue in the IT service industry. A large service provider handles, on daily basis, thousands of tickets that report various types of problems from its...
Yi Chen, Shu Tao, Xifeng Yan, Nikos Anerousis, Qih...
AAAI
2010
13 years 11 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
« Prev « First page 2270 / 2411 Last » Next »