In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Loosely structured heterogeneous information spaces are typically created by merging data from a variety of different applications and information sources. A common problem these...
Ekaterini Ioannou, Saket Sathe, Nicolas Bonvin, An...
The increasingly huge volume of financial information found in a number of heterogeneous business sources is characterized by unstructured content, disparate data models and impli...
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...