Sciweavers

1972 search results - page 252 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
ICALP
2001
Springer
15 years 9 months ago
Permutation Editing and Matching via Embeddings
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...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
JCB
2007
146views more  JCB 2007»
15 years 4 months ago
MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving variou...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
KR
2004
Springer
15 years 9 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
ANOR
2010
102views more  ANOR 2010»
15 years 4 months ago
Optimal control of dosage decisions in controlled ovarian hyperstimulation
Abstract In the controlled ovary hyperstimulation (COH) cycle of the in vitro fertilization-embryo transfer (IVFET) therapy, the clinicians observe the patients' responses to ...
Miao He, Lei Zhao, Warren B. Powell
PPPJ
2009
ACM
15 years 11 months ago
Lazy continuations for Java virtual machines
Continuations, or ’the rest of the computation’, are a concept that is most often used in the context of functional and dynamic programming languages. Implementations of such ...
Lukas Stadler, Christian Wimmer, Thomas Würth...