Sciweavers

2649 search results - page 482 / 530
» Temporal Theories of Reasoning
Sort
View
AAAI
1994
13 years 9 months ago
Heuristic Harvesting of Information for Case-Based Argument
The BankXX system models the process of perusing and gathering information for argument as a heuristic best-first search for relevant cases, theories, and other domain-specific in...
Edwina L. Rissland, David B. Skalak, M. Timur Frie...
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
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
BMCBI
2006
147views more  BMCBI 2006»
13 years 7 months ago
A case study in pathway knowledgebase verification
Background: Biological databases and pathway knowledgebases are proliferating rapidly. We are developing software tools for computer-aided hypothesis design and evaluation, and we...
Stephen A. Racunas, Nigam Shah, Nina V. Fedoroff
LOGCOM
2008
94views more  LOGCOM 2008»
13 years 7 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...