5138 search results - page 703 / 1028 » Randomized Algorithms for 3-SAT |
140
click to vote
ICDM
2003
IEEE
15 years 12 months ago
2003
IEEE
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of...
173
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
: This paper presents a new tightly coupled computation/communication design developed to support the unique operational requirements of sensor webs. A critical challenge of sensor...
174
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
184
click to vote
VTS
2003
IEEE
15 years 12 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
149
click to vote
CSCLP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...