Sciweavers

17329 search results - page 2946 / 3466
» Improved non-approximability results
Sort
View
ESWA
2008
162views more  ESWA 2008»
15 years 7 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
ESWA
2008
113views more  ESWA 2008»
15 years 7 months ago
Taxonomy alignment for interoperability between heterogeneous virtual organizations
Resources in virtual organizations are classified based on their local taxonomies. However, heterogeneity between these taxonomies is a serious problem for efficient cooperation p...
Jason J. Jung
AUTOMATICA
2006
80views more  AUTOMATICA 2006»
15 years 7 months ago
State estimation over packet dropping networks using multiple description coding
For state estimation over a communication network, efficiency and reliability of the network are critical issues. The presence of packet dropping and communication delay can great...
Zhipu Jin, Vijay Gupta, Richard M. Murray
FAC
2008
100views more  FAC 2008»
15 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FGCS
2008
135views more  FGCS 2008»
15 years 7 months ago
An on-line replication strategy to increase availability in Data Grids
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
Ming Lei, Susan V. Vrbsky, Xiaoyan Hong
« Prev « First page 2946 / 3466 Last » Next »