7522 search results - page 35 / 1505 » Spacing memetic algorithms |
101
Voted
COCO
2010
Springer
15 years 4 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
110
Voted
STOC
2005
ACM
16 years 21 days ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
109
Voted
DGCI
2009
Springer
15 years 3 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
98
Voted
KES
1998
Springer
15 years 4 months ago
1998
Springer
-A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally optimal solution. Some other investigations have also been made for detecting multiple solutions...