Abstract. We devise a theoretical model for dichotomic search algorithms for constrained optimization. We show that, within our model, a certain way of choosing the breaking point ...
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Aesthetic features such as animation, 3D interaction, and visual metaphors are becoming commonplace in multimedia search interfaces. However, it is unclear which attributes are ne...
This paper presents an optimisation technique to automatically select a set of control parameters for a Markov Random Field. The method is based on the Reactive Tabu Search strate...
Umberto Castellani, Andrea Fusiello, Riccardo Gher...
We present an automated deduction system for equational reasoning combining two different parallelization/distribution schemes: Strategy-compliant parallelization on the level of ...