3422 search results - page 188 / 685 » Random Subset Optimization |
156
click to vote
HEURISTICS
2002
15 years 5 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
203
click to vote
JMLR
2010
15 years 28 days ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
174
Voted
WICON
2008
15 years 7 months ago
2008
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
155
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
152
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...