1941 search results - page 55 / 389 » On the Hardness of Approximate Reasoning |
TCBB
2010
14 years 10 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
LPNMR
2005
Springer
15 years 5 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
174
click to vote
SIAMCOMP
2011
14 years 2 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
ESWS
2010
Springer
15 years 3 months ago
2010
Springer
The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools ex...
100
click to vote
AAAI
1990
15 years 1 months ago
1990
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...