Sciweavers

804 search results - page 73 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
15 years 6 months ago
Clustering with Niching Genetic K-means Algorithm
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
Weiguo Sheng, Allan Tucker, Xiaohui Liu
KDD
1995
ACM
106views Data Mining» more  KDD 1995»
15 years 4 months ago
Structured and Unstructured Induction with EDAGs
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
Brian R. Gaines
112
Voted
ICVGIP
2004
15 years 2 months ago
On Learning Shapes from Shades
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
15 years 5 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
ICCAD
2003
IEEE
170views Hardware» more  ICCAD 2003»
15 years 9 months ago
Evaluation of Placement Techniques for DNA Probe Array Layout
DNA probe arrays have emerged as a core genomic technology that enables cost-effective gene expression monitoring, mutation detection, single nucleotide polymorphism analysis and ...
Andrew B. Kahng, Ion I. Mandoiu, Sherief Reda, Xu ...