We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
This paper presents a novel method for DNA microarray gridding based on Support Vector Machine (SVM) classifiers. It employs a set of soft-margin SVMs to estimate the lines of the ...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Distributed mobile applications operate on devices with diverse capabilities, in heterogeneous environments, where parameters such as processor, memory and network utilisation, are...