Assessing Metaheuristics by Means of Random Benchmarks

Solving the Response Time Variability Problem by means of metaheuristics

The Response Time Variability Problem (RTVP) is a combinatorial NPhard problem which has a wide range of real-life applications. It has recently appeared in the literature and has therefore not been widely discussed to date. The RTVP has been solved in other works by mixed integer linear programming (for small instances) and heuristics, but metaheuristic procedures have not previously been used...

Generating Benchmarks by Random Stepwise Refinement of Petri Nets

The quality of algorithms is often determined by benchmarking, i.e., testing the algorithm on a predetermined data set. In contrast to traditional benchmarking, with fixed data set, we present a way to generate random sets of test data. In this paper we present random classes of Petri nets and a method to generate finite samples from such a class. The classes may contain infinitely many Petri n...

Generating Random Benchmarks for Description Logics

Assessing European power grid reliability by means of topological measures

Reliability assessment is crucial when dealing with complex systems, especially complex networks. Be they natural or man made, networks are able to sustain their functioning by means of a reliable set of components. The many functions a network can sustain are direct consequence of the topological structure that constraints and, at the same time, defines, the dynamical relation between its comp...

Assessing accuracy in linkage analysis by means of confidence regions.

When statistical linkage to a certain chromosomal region has been found, it is of interest to develop methods quantifying the accuracy with which the disease locus can be mapped. In this paper, we investigate the performance of three different types of confidence regions, with asymptotically correct coverage probability as the number of pedigrees grows. Our setup is that of a saturated map of m...