Sciweavers

135 search results - page 17 / 27
» Real-Coded Genetic Algorithm for Solving Generalized Polynom...
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 9 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SAC
2006
ACM
13 years 8 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
14 years 2 months ago
Interactive evolution of XUL user interfaces
We attack the problem of user fatigue by using an interactive genetic algorithm to evolve user interfaces in the XUL interface definition language. The interactive genetic algori...
Juan C. Quiroz, Sushil J. Louis, Sergiu M. Dascalu
RECOMB
1997
Springer
14 years 22 days ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 28 days ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...