291 search results - page 13 / 59 » How Well Can Primal-Dual and Local-Ratio Algorithms Perform |
JSAT
2008
15 years 1 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
108
click to vote
AAAI
1998
15 years 2 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
110
click to vote
KDD
1998
ACM
15 years 5 months ago
1998
ACM
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
122
click to vote
ICAC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— The increasing computing and communication capabilities of multi-function devices (MFDs) have enabled networks of such devices to provide value-added services. This has...
UAI
2001
15 years 2 months ago
2001
In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...