Sciweavers

501 search results - page 40 / 101
» Scheduling Abstractions for Local Search
Sort
View
COR
2010
119views more  COR 2010»
15 years 28 days ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 6 months ago
Reducing the Cost of the Hybrid Evolutionary Algorithm with Image Local Response in Electronic Imaging
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
Igor V. Maslov
110
Voted
FGR
2011
IEEE
201views Biometrics» more  FGR 2011»
14 years 4 months ago
Sparse shape registration for occluded facial feature localization
Abstract— This paper proposes a sparsity driven shape registration method for occluded facial feature localization. Most current shape registration methods search landmark locati...
Fei Yang, Junzhou Huang, Dimitris N. Metaxas
118
Voted
GCB
2010
Springer
198views Biometrics» more  GCB 2010»
14 years 10 months ago
RNALfoldz: Efficient Prediction of Thermodynamically Stable, Local Secondary Structures
Abstract: The search for local RNA secondary structures and the annotation of unusually stable folding regions in genomic sequences are two well motivated bioinformatic problems. I...
Andreas R. Gruber, Stephan H. F. Bernhart, You Zho...
MOBIHOC
2005
ACM
16 years 12 days ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas