In this paper we present new local search algorithms for the Probabilistic Traveling Salesman Problem (PTSP) using sampling and ad-hoc approximation. These algorithms improve both...
Dennis Weyland, Leonora Bianchi, Luca Maria Gambar...
Model-based testing generates test cases from a high-level model. Current models employ extensions to finite-state machines. This work proposes a separation of transitions in the ...
Abstract. In Computational Neuroscience, mathematical and computational modeling are differentiated. In this paper, both kinds of modeling are considered. In particular, modeling ...
Abstract. In this work we consider the application of metaheuristic algorithms to the problem of fitting rectangular signals to time-data series. The application background is to ...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
The need for a design language that is rigorous but accessible and intuitive is often at odds with the formal and mathematical nature of languages used for analysis. UML and Petri ...