Sciweavers

70 search results - page 5 / 14
» Computing the Width of a Three-Dimensional Point Set: An Exp...
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
CG
2004
Springer
13 years 7 months ago
Views of Fibonacci dynamics
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
Clifford A. Reiter
COMPGEOM
2004
ACM
14 years 24 days ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
CE
2007
111views more  CE 2007»
13 years 7 months ago
Developing strategic and reasoning abilities with computer games at primary school level
The paper reports a small-scale, long-term pilot project designed to foster strategic and reasoning abilities in young primary school pupils by engaging them in a number of comput...
Rosa Maria Bottino, Lucia Ferlino, Michela Ott, Ma...
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 1 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...