Sciweavers

887 search results - page 172 / 178
» A Science of Reasoning
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
AI
2008
Springer
13 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
BMCBI
2010
112views more  BMCBI 2010»
13 years 7 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke
BMCBI
2008
116views more  BMCBI 2008»
13 years 7 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
BMCBI
2008
133views more  BMCBI 2008»
13 years 7 months ago
Towards ontology-driven navigation of the lipid bibliosphere
Background: The indexing of scientific literature and content is a relevant and contemporary requirement within life science information systems. Navigating information available ...
Christopher J. O. Baker, Kanagasabai Rajaraman, We...