89 search results - page 11 / 18 » Robust solutions for combinatorial auctions |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
EVOW
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
IGPL
2011
13 years 2 months ago
2011
This paper presents J-MADeM, a multi-modal decision making mechanism to provide agents in a Multi-Agent Systems (MAS) with a market-based model for complex decision problems. J-MA...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...