Theoretical properties of a neighborhood-based approach for widening

DOI10.55630/SJC.2020.14.65-91MaRDI QIDQ5868048zbMATH OpenOpenAlexFDO

Authors Violeta N. Ivanova-Rohling

Publication date 19 September 2022

Published in Serdica Journal of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.55630/sjc.2020.14.65-91

zbMATH Keywords

wideninglattice traversalparallel data miningparallel neighborhood-based search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Widening: using parallel resources to improve model quality
• Parallel local search
• Parallel approaches for the artificial bee colony algorithm
• Parallel line search
• Parallel clustering methods for data mining

Cited in

(1)

• Widening: using parallel resources to improve model quality

This page was built for publication: Theoretical properties of a neighborhood-based approach for widening

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868048)