Sciweavers

697 search results - page 49 / 140
» Improving EAs for Sequencing Problems
Sort
View
CCE
2004
13 years 9 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
AAIP
2009
13 years 10 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
ICPP
2009
IEEE
14 years 3 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
BMVC
1998
13 years 10 months ago
Benchmarking of Bootstrap Temporal Stereo using Statistical and Physical Scene Modelling
Temporal stereo vision algorithms can offer improved robustness, however, this can only be delivered after several frames of a stereo image sequence have been processed. We presen...
S. Crossley, Neil A. Thacker, N. Luke Seed