Sciweavers

610 search results - page 68 / 122
» Solving Geometrical Place Problems by using Evolutionary Alg...
Sort
View
119
Voted
ISDA
2005
IEEE
15 years 9 months ago
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy
This paper proposes a novel adaptive representation for evolutionary multiobjective optimization for solving a stock modeling problem. The standard Pareto Achieved Evolution Strat...
Mihai Oltean, Crina Grosan, Ajith Abraham, Mario K...
138
Voted
WSCG
2004
120views more  WSCG 2004»
15 years 5 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
COMPGEOM
2006
ACM
15 years 9 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
151
Voted
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 7 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
FTTCS
2006
132views more  FTTCS 2006»
15 years 3 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter