5316 search results - page 195 / 1064 » Which Search Problems Are Random |
152
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
119
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
123
click to vote
CONSTRAINTS
2006
15 years 3 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
139
Voted
AIMSA
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
129
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper proposes to incorporate bootstrap of data, random feature subspace and evolutionary algorithm with negative correlation learning to automatically design accurate and...