2657 search results - page 131 / 532 » On the complexity of hierarchical problem solving |
110
click to vote
DNA
2006
Springer
15 years 5 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
102
click to vote
LMCS
2007
15 years 1 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
105
click to vote
CORR
2010
Springer
15 years 6 days ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
CCA
2009
Springer
15 years 8 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
108
click to vote
EMNLP
2004
15 years 3 months ago
2004
We perform Noun Phrase Bracketing by using a local, maximum entropy-based tagging model, which produces bracketing hypotheses. These hypotheses are subsequently fed into a reranki...