Sciweavers

15033 search results - page 129 / 3007
» Complexity Theory and Algorithms
Sort
View
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
15 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...
GECCO
2010
Springer
127views Optimization» more  GECCO 2010»
15 years 2 months ago
Set-based multi-objective optimization, indicators, and deteriorative cycles
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
FSS
2010
111views more  FSS 2010»
15 years 2 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
GIS
2010
ACM
15 years 1 months ago
Cleaning massive sonar point clouds
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Lars Arge, Kasper Green Larsen, Thomas Mølh...
JACM
2002
122views more  JACM 2002»
15 years 3 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer