4432 search results - page 212 / 887 » Solving Demodulation as an Optimization Problem |
102
click to vote
EOR
2006
15 years 3 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
99
Voted
ICS
2010
Tsinghua U.
16 years 29 days ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
112
Voted
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Co-evolutionary algorithms (CEAs) have been applied to optimization and machine learning problems with often mediocre results. One of the causes for the unfulfilled expectations i...
127
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
117
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...