An evolutionary approach to solving the maximum size consecutive ones submatrix and related problems
The Consecutive Ones Submatrix (C1S) has a vital role in real world applications. Consequently, there are continuous concern and demand to solve this problem via efficient algorithms. These algorithms are judged on the basis of their robustness, ease of use, and their computational time. The main ai...
| Main Author: | |
|---|---|
| Published: |
University of Essex
2017
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.732612 |