Sciweavers

107 search results - page 17 / 22
» Finding Compact BDDs Using Genetic Programming
Sort
View
ENTCS
2002
181views more  ENTCS 2002»
13 years 6 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
ISI
2008
Springer
13 years 6 months ago
Real time intrusion prediction, detection and prevention programs
An Intrusion Detection Program (IDP) analyzes what happens or has happened during an execution and tries to find indications that the computer has been misused. In this talk, we p...
A. Abraham
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 10 months ago
Local search for multiobjective function optimization: pareto descent method
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi
CEC
2010
IEEE
13 years 7 months ago
Tree-adjunct grammatical evolution
In this paper we investigate the application of tree-adjunct grammars to grammatical evolution. The standard type of grammar used by grammatical evolution, context-free grammars, p...
Eoin Murphy, Michael O'Neill, Edgar Galván ...
CP
2003
Springer
13 years 12 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...