First Page | Document Content | |
---|---|---|
![]() Date: 2013-09-14 08:17:58Search algorithms NP-complete problems Heuristics Approximation algorithm Computational complexity theory Heuristic function Minimax Algorithm Closest string Mathematics Theoretical computer science Applied mathematics | Source URL: pages.cs.aueb.grDownload Document from Source WebsiteFile Size: 191,99 KBShare Document on Facebook |
![]() | PDF DocumentDocID: 1iOqz - View Document |
![]() | Finding Optimal Alignment and Consensus of Circular Strings T. Lee*, J.C. Na, H. Park, K. Park, and J.S. Sim *Seoul National University June 23, 2010DocID: 15EfY - View Document |
![]() | Randomized and Parameterized Algorithms for the Closest String Problem Zhi-Zhong Chen Tokyo Denki University Joint withDocID: 15Cdq - View Document |
![]() | Custom Care Spare Parts Bars CUSTOM CARE PARTS – SEAT COMPONENT ORDERS CAN BE MADE BY CONTACTING YOUR CLOSEST CUSTOM CARE NEW SOUTH WALES & ACTDocID: 14ZES - View Document |
![]() | Matrix multiplication and pattern matching under Hamming norm Rapha¨el Clifford January 23, 2009 Abstract My understanding of a conversation with Ely Porat who in turn attributes Piotr Indyk.DocID: 14uPM - View Document |