2393 search results - page 309 / 479 » Bounds-Consistent Local Search |
132
Voted
EWCBR
2006
Springer
15 years 6 months ago
2006
Springer
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
102
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
105
Voted
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
114
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
123
Voted
AAAI
2004
15 years 4 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...