1984 search results - page 167 / 397 » The colourful feasibility problem |
165
click to vote
RTAS
2008
IEEE
16 years 26 days ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
165
click to vote
GECCO
2007
Springer
16 years 19 days 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...
140
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
168
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
164
click to vote
AAAI
2007
15 years 8 months ago
2007
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...