Sciweavers

721 search results - page 98 / 145
» Summability in topological spaces
Sort
View
ICMLA
2004
14 years 11 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
ESANN
2003
14 years 11 months ago
High-dimensional labeled data analysis with Gabriel graphs
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
Michaël Aupetit
WSCG
2004
239views more  WSCG 2004»
14 years 11 months ago
General n-Dimensional Rotations
This paper presents a generalized approach for performing general rotations in the n-Dimensional Euclidean space around any arbitrary (n-2)-Dimensional subspace. It first shows th...
Antonio Aguilera, Ricardo Pérez-Aguila
DAGSTUHL
1997
14 years 11 months ago
Constrained Navigation Environments
Finding one’s way through a complex virtual environment is a standard task in 3D graphics and virtual reality applications. Constrained navigation is a method that appropriately...
Andrew J. Hanson, Eric A. Wernert, Stephen B. Hugh...
GECCO
2008
Springer
153views Optimization» more  GECCO 2008»
14 years 11 months ago
G-Metric: an M-ary quality indicator for the evaluation of non-dominated sets
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
Giovanni Lizárraga Lizárraga, Arturo...