187 search results - page 11 / 38 » Benchmarking and solving dynamic constrained problems |
82
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Genetic Algorithms have widely been used for solving optimization problems in stationary environments. In recent years, there has been a growing interest for investigating and imp...
108
click to vote
HEURISTICS
2010
14 years 7 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
116
click to vote
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...