C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Using a sparse promoting method in linear programming approximations to schedule parallel jobs.
Stéphane Chrétien
Jean-Marc Nicod
Laurent Philippe
Veronika Rehn-Sonigo
Lamiel Toch
Published in:
Concurr. Comput. Pract. Exp. (2015)
Keyphrases
</>
high accuracy
significant improvement
dynamic programming
clustering method
high precision
similarity measure
objective function
computational cost
linear programming
detection method
evolutionary algorithm
cost function
edge detection
feature set
model selection
parallel implementation