465 search results - page 46 / 93 » On the Hardness of Range Assignment Problems |
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
ISCC
2003
IEEE
15 years 5 months ago
2003
IEEE
Interactivity in transport protocol can greatly benefit transport friendly applications. We envision if a transport mechanism, which is interactive and can provide event notificat...
HICSS
1997
IEEE
15 years 4 months ago
1997
IEEE
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
112
click to vote
DATAMINE
2010
14 years 12 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
DAM
2007
14 years 12 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...