681 search results - page 75 / 137 » General Polynomial Time Decomposition Algorithms |
91
Voted
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
83
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
118
click to vote
AAAI
2004
15 years 1 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
NIPS
1993
15 years 1 months ago
1993
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
103
click to vote
ITA
2007
15 years 10 days ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...