9842 search results - page 295 / 1969 » The Complexity of the Matching-Cut Problem |
135
Voted
ITSL
2008
15 years 5 months ago
2008
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
129
Voted
WSC
2008
15 years 6 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
126
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
158
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
134
Voted
COCO
2007
Springer
15 years 7 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...