152 search results - page 13 / 31 » An Experimental Study of Random Knapsack Problems |
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
ECP
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
EC
2008
13 years 6 months ago
2008
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
AAAI
2010
13 years 7 months ago
2010
Motivated by a real-world problem, we study a novel budgeted optimization problem where the goal is to optimize an unknown function f(x) given a budget. In our setting, it is not ...