9842 search results - page 330 / 1969 » The Complexity of the Matching-Cut Problem |
121
click to vote
CP
1999
Springer
15 years 8 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
138
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
143
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
115
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
The two key problems in video transcoding are complexity reduction and quality management. The complexity of H.264 encoding makes complexity reduction even more important. A good ...
155
click to vote
VRST
2009
ACM
15 years 10 months ago
2009
ACM
Simulating crowds in complex environment is fascinating and challenging, however, modeling of the environment is always neglected in the past, which is one of the essential proble...