Sciweavers

1653 search results - page 274 / 331
» Computer science and game theory
Sort
View
AI
2000
Springer
13 years 9 months ago
On agent-based software engineering
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
Nicholas R. Jennings
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
CCA
2009
Springer
14 years 4 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
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....
EUROPAR
2003
Springer
14 years 3 months ago
RECSY - A High Performance Library for Sylvester-Type Matrix Equations
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
Isak Jonsson, Bo Kågström