Sciweavers

248 search results - page 30 / 50
» The Relative Complexity of NP Search Problems
Sort
View
ISB
2002
140views more  ISB 2002»
14 years 9 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
SPATIALCOGNITION
2000
Springer
15 years 1 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
105
Voted
CEC
2005
IEEE
15 years 3 months ago
Elitist generational genetic chromodynamics - a new radii-based evolutionary algorithm for multimodal optimization
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
Catalin Stoean, Mike Preuss, Ruxandra Gorunescu, D...
80
Voted
AAAI
1990
14 years 10 months ago
Integrating Natural Language Processing and Knowledge Based Processing
A central problem in text-understanding research is the indeterminacy of natural language. Two related issues that arise in confronting this problem are the need to make complex i...
Rebecca J. Passonneau, Carl Weir, Timothy W. Finin...
82
Voted
IJON
2010
199views more  IJON 2010»
14 years 7 months ago
DFS-generated pathways in GA crossover for protein structure prediction
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul ...