Sciweavers

1754 search results - page 89 / 351
» Games with Incomplete Information
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
14 years 2 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
FPLAY
2008
13 years 11 months ago
Using genres to customize usability evaluations of video games
Video games are varied, with vastly different visual layouts and interaction styles; however, most games that share a common genre still have many user interface similarities. The...
David Pinelle, Nelson Wong, Tadeusz Stach
IEEECIT
2006
IEEE
14 years 4 months ago
A Service Retrieval Model with Enhanced Dominance-Based Rough Sets
As an important part of service-oriented software engineering, service retrieval receives much attention from industry and academia, but which still leaves much to be expected: ho...
Bin Tang, Leqiu Qian, Ruzhi Xu, Yunjiao Xue, Hui T...
CSCLP
2004
Springer
14 years 3 months ago
A Note on Bilattices and Open Constraint Programming
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
Arnaud Lallouet
ECAI
2010
Springer
13 years 11 months ago
Probabilistic Logic with Conditional Independence Formulae
We investigate probabilistic propositional logic as a way of expressing and reasoning about uncertainty. In contrast to Bayesian networks, a logical approach can easily cope with i...
Magdalena Ivanovska, Martin Giese