A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation (bibtex)
by , ,
Reference:
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length CalculationMarko Djukanovic, Günther R. Raidl, Christian BlumThe 5th International Conference on Machine Learning, Optimization and Data Science – LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), 2019, Springer.Note: to appear
Bibtex Entry:
@inproceedings{djukanovic-19b,
	author = {Marko Djukanovic and G{\"{u}}nther R. Raidl and Christian Blum},
        title = {A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation},
	booktitle = {The 5th International Conference on Machine
	Learning, Optimization and Data Science -- LOD 2019},
	editor = {Giuseppe Nicosia and Panos Pardalos and Giovanni Giuffrida and Renato Umeton and Vincenzo Sciacca},
	series = {LNCS},
	publisher = {Springer},
	year = {2019},
        %url={https://www.ac.tuwien.ac.at/files/pub/djukanovic-19b.pdf}, 
	note = {to appear}
}
Powered by bibtexbrowser