Sciweavers

7820 search results - page 357 / 1564
» Formalization of Time and Space
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
16 years 5 days ago
BBOB-benchmarking the DIRECT global optimization algorithm
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during ...
Petr Posik
ALGORITHMICA
2010
75views more  ALGORITHMICA 2010»
15 years 7 months ago
In-Place Algorithms for Computing (Layers of) Maxima
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
Henrik Blunck, Jan Vahrenhold
ICFCA
2010
Springer
16 years 10 days ago
A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing
A feature of Formal Concept Analysis is the use of the line diagram of the concept lattice to visualize a conceptual space. The line diagram is a specialized form of Hasse diagram ...
Peter W. Eklund, Jean Villerd
JAR
2008
88views more  JAR 2008»
15 years 7 months ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
16 years 1 months ago
Geometric crossovers for real-code representation
Geometric crossover is a representation-independent generalization of the class of traditional mask-based crossover for binary strings. It is based on the distance of the search s...
Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byun...