1310 search results - page 191 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
SIAMCO
2002
13 years 8 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
AOSD
2011
ACM
13 years 12 days ago
2011
ACM
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
WEA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...