101 search results - page 14 / 21 » Solving Combinatorial Auctions Using Stochastic Local Search |
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
COR
2010
13 years 7 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...