1964 search results - page 97 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
EC
2008
13 years 8 months ago
2008
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...
CPM
1998
Springer
14 years 3 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
EC
2010
13 years 8 months ago
2010
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...