Sciweavers

1972 search results - page 308 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
ANOR
2008
171views more  ANOR 2008»
15 years 5 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
108
Voted
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 5 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
JMIV
2008
83views more  JMIV 2008»
15 years 4 months ago
On Straight Line Segment Detection
In this paper we propose a comprehensive method for detecting straight line segments in any digital image, accurately controlling both false positive and false negative detections....
Rafael Grompone von Gioi, Jérémie Ja...
IEEECIT
2010
IEEE
15 years 3 months ago
Scaling the iHMM: Parallelization versus Hadoop
—This paper compares parallel and distributed implementations of an iterative, Gibbs sampling, machine learning algorithm. Distributed implementations run under Hadoop on facilit...
Sebastien Bratieres, Jurgen Van Gael, Andreas Vlac...
TMC
2010
139views more  TMC 2010»
15 years 3 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao