9842 search results - page 1316 / 1969 » The Complexity of the Matching-Cut Problem |
191
click to vote
CCE
2008
15 years 7 months ago
2008
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
221
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
185
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
207
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Adaptive orthogonal frequency division multiple access (OFDMA) has recently been recognized as a promising technique for providing high spectral efficiency in future broadband wire...
194
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...