Sciweavers

159 search results - page 9 / 32
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 6 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
CSL
2003
Springer
15 years 5 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
JACM
2007
160views more  JACM 2007»
14 years 11 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
ATAL
2010
Springer
15 years 26 days ago
Collective argument evaluation as judgement aggregation
cting knowledge base can be seen abstractly as a set of arguments and a binary relation characterising conflict among them. There may be multiple plausible ways to evaluate confli...
Iyad Rahwan, Fernando Tohmé
MC
2001
116views Computer Science» more  MC 2001»
15 years 1 months ago
Emotions and Multimodal Interface-Agents: A Sociological View
Designing human-computer interfaces that are easy and intuitive to use is important for the use of computer technology in general. Due to the growing complexity of information sys...
Daniel Moldt, Christian von Scheve