Sciweavers

348 search results - page 1 / 70
» Do additional objectives make a problem harder
Sort
View
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
13 years 10 months ago
Do additional objectives make a problem harder?
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...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 8 months ago
Making Hard Problems Harder
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...
Joshua Buresh-Oppenheim, Rahul Santhanam
FLAIRS
2003
13 years 5 months ago
Proving Harder Theorems by Axiom Reduction
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...
Geoff Sutcliffe, Alexander Dvorský
NIPS
2001
13 years 5 months ago
Constructing Distributed Representations Using Additive Clustering
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...
Wheeler Ruml
JSS
2007
123views more  JSS 2007»
13 years 4 months ago
Do programmer pairs make different mistakes than solo programmers?
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
Matthias M. Müller