9842 search results - page 116 / 1969 » The Complexity of the Matching-Cut Problem |
CISIS
2009
IEEE
13 years 8 months ago
2009
IEEE
The capability to provide a platform for flexible business services in the Air Traffic Management (ATM) domain is both a major success factor for the ATM industry and a challenge ...
DISOPT
2011
13 years 5 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
COCOON
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
AAAI
1990
13 years 11 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...