scholarly journals A Parameterized Study of Maximum Generalized Pattern Matching Problems

Algorithmica ◽  
2015 ◽  
Vol 75 (1) ◽  
pp. 1-26 ◽  
Author(s):  
Sebastian Ordyniak ◽  
Alexandru Popa
Author(s):  
Jérémie Bourdon ◽  
Brigitte Vallée

2008 ◽  
Vol 30 (3) ◽  
pp. 889-904 ◽  
Author(s):  
Ying Fan ◽  
Qiang Liang ◽  
Yi-Ming Wei

2015 ◽  
Vol 24 (2) ◽  
pp. 249-263 ◽  
Author(s):  
Christian John ◽  
Dietmar Tutsch ◽  
Thomas Lepich ◽  
Bernard Beitz ◽  
Reinhard Möller

AbstractThis paper presents a concept for pattern matching based on a parameter optimization system for approximative numerical calculation of some parameter combination under soft and hard constraints. The concept uses a non-linear parameter optimization method with an iterative variation of parameters. The paper focuses on the information modeling process to migrate problem-domain specific criteria into optimization-compatible objects suitable for a standardized parameter optimization procedure. A step-by-step transformation process is presented and implemented in object-oriented programming: classes and interfaces. The method is applicable to a wide range of pattern-matching problems due to its flexibility and extensibility.


Sign in / Sign up

Export Citation Format

Share Document