Sciweavers

15485 search results - page 213 / 3097
» Computing Optimal Subsets
Sort
View
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
15 years 10 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
GECCO
2000
Springer
123views Optimization» more  GECCO 2000»
15 years 10 months ago
Genomic computing: explanatory modelling for functional genomics
Many newly discovered genes are of unknown function. DNA microarrays are a method for determining the expression levels of all genes in an organism for which a complete genome seq...
Richard J. Gilbert, Jem J. Rowland, Douglas B. Kel...
GECCO
2000
Springer
15 years 10 months ago
Genetic Programming within a Framework of Computer-Aided Discovery of Scientific Knowledge
Present day instrumentation networks already provide immense quantities of data, very little of which provides any insights into the basic physical phenomena that are occurring in...
Maarten Keijzer, Vladan Babovic
IIS
2004
15 years 7 months ago
Application of evolutionary computing to conformational analysis
In this paper we report new results concerning use of genetic algorithms in conformational analysis, field of pharmacy related to discovery and design of new drugs. The goal is to ...
Aleksander Wawer, Franciszek Seredynski, Pascal Bo...