In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...