152 search results - page 19 / 31 » An Experimental Study of Random Knapsack Problems |
ADMA
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
102
Voted
CORR
2002
Springer
15 years 13 days ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
116
click to vote
TMM
2002
15 years 8 days ago
2002
Modeling spatial context (e.g., autocorrelation) is a key challenge in classification problems that arise in geospatial domains. Markov random fields (MRF) is a popular model for i...
110
Voted
IPMI
2003
Springer
16 years 1 months ago
2003
Springer
Abstract. We describe the use of non-parametric permutation tests to detect activation in cortically-constrained maps of current density computed from MEG data. The methods are app...
95
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...