Sciweavers

2376 search results - page 387 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
COR
2010
110views more  COR 2010»
13 years 9 months ago
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is partially based on principles of the scatter search methodology, but it makes use of inn...
Jose A. Egea, Rafael Martí, Julio R. Banga
COR
2010
116views more  COR 2010»
13 years 9 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
EOR
2008
52views more  EOR 2008»
13 years 9 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
JVCIR
2006
88views more  JVCIR 2006»
13 years 9 months ago
Morphological wavelet-based stereo image coders
In this paper, we propose a family of novel stereoscopic image coders based on morphological coding and a block-based disparity compensation algorithm. The proposed schemes employ...
J. N. Ellinas, M. S. Sangriotis
VC
2008
102views more  VC 2008»
13 years 8 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...