Sciweavers

10051 search results - page 1525 / 2011
» A Dynamic Separator Algorithm
Sort
View
184
Voted
ANOR
2008
171views more  ANOR 2008»
15 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
AUTOMATICA
2007
113views more  AUTOMATICA 2007»
15 years 6 months ago
Asymptotic rejection of unknown sinusoidal disturbances in nonlinear systems
This paper deals with global disturbance rejection of nonlinear systems. The disturbance is assumed to be sinusoidal with completely unknown phases, amplitude, and frequencies, bu...
Zhengtao Ding
CGF
2008
89views more  CGF 2008»
15 years 6 months ago
Enhancement of Bright Video Features for HDR Displays
To utilize the full potential of new high dynamic range (HDR) displays, a system for the enhancement of bright luminous objects in video sequences is proposed. The system classifi...
Piotr Didyk, Rafal Mantiuk, Matthias Hein, Hans-Pe...
123
Voted
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 6 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer
116
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
Evaluating Call-By-Need on the Control Stack
Abstract. Ariola and Felleisen's call-by-need -calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substituti...
Stephen Chang, David Van Horn, Matthias Felleisen
« Prev « First page 1525 / 2011 Last » Next »