66 search results - page 1 / 14 » Automated Generation of Search Tree Algorithms for Hard Grap... |
ALGORITHMICA
2004
13 years 8 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
CORR
2011
Springer
13 years 3 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
EACL
2009
ACL Anthology
13 years 6 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...