Sciweavers

1629 search results - page 108 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
15 years 1 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
CAINE
2003
14 years 11 months ago
A Genetic Algorithm for Clustering on Very Large Data Sets
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
Jim Gasvoda, Qin Ding
ASPDAC
2008
ACM
108views Hardware» more  ASPDAC 2008»
14 years 12 months ago
Synthesis and design of parameter extractors for low-power pre-computation-based content-addressable memory using gate-block sel
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
Jui-Yuan Hsieh, Shanq-Jang Ruan
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 1 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
CN
2004
138views more  CN 2004»
14 years 9 months ago
Overhead energy considerations for efficient routing in wireless sensor networks
Energy is the most critical resource in the life of a wireless sensor node. Therefore, its usage must be optimized to maximize the network life. It is known that for higher path l...
E. Ilker Oyman, Cem Ersoy