Sciweavers

2435 search results - page 133 / 487
» Question Answering in Webclopedia
Sort
View
AISC
2004
Springer
15 years 11 months ago
Planning and Patching Proof
We describe proof planning: a technique for both describing the hierarchical structure of proofs and then using this structure to guide proof attempts. When such a proof attempt fa...
Alan Bundy
COCOON
2003
Springer
15 years 11 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
FOCS
2002
IEEE
15 years 11 months ago
Market Equilibrium via a Primal-Dual-Type Algorithm
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...
Nikhil R. Devanur, Christos H. Papadimitriou, Amin...
FSTTCS
2001
Springer
15 years 10 months ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender
CLEF
2007
Springer
15 years 10 months ago
What Happened to Esfinge in 2007?
Esfinge is a general domain Portuguese question answering system which uses the information available on the Web as an additional resource when searching for answers. Other externa...
Luís Miguel Cabral, Luís Fernando Co...