In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
ion for Stochastic Systems by Erlang's Method of Stages Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 1 RWTH Aachen University 2 TU Munich 3 EPF La...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...
With developments in Grid computing and Web based data storage the task of orchestrating computations is becoming ever more difficult. Identifying which of the available computati...
Stephen Crouch, Peter Henderson, Robert John Walte...
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...