Sciweavers

29908 search results - page 218 / 5982
» On the Complexity of
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 6 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
AI
2006
Springer
15 years 6 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
CORR
2006
Springer
155views Education» more  CORR 2006»
15 years 6 months ago
Complexity and Philosophy
The science of complexity is based on a new way of thinking that stands in sharp contrast to the philosophy underlying Newtonian science, which is based on reductionism, determinis...
Francis Heylighen, Paul Cilliers, Carlos Gershenso...
IJAR
2008
95views more  IJAR 2008»
15 years 6 months ago
Complexity results for enhanced qualitative probabilistic networks
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
Johan Kwisthout, Gerard Tel
ENTCS
2006
153views more  ENTCS 2006»
15 years 6 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu