Sciweavers

2609 search results - page 338 / 522
» Optimizing for parallelism and data locality
Sort
View
COR
2010
119views more  COR 2010»
15 years 5 months 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
ESWA
2008
162views more  ESWA 2008»
15 years 5 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
CSL
2007
Springer
15 years 5 months ago
Partially observable Markov decision processes for spoken dialog systems
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
Jason D. Williams, Steve Young
PODC
2011
ACM
14 years 8 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
HPDC
2012
IEEE
13 years 7 months ago
Work stealing and persistence-based load balancers for iterative overdecomposed applications
Applications often involve iterative execution of identical or slowly evolving calculations. Such applications require incremental rebalancing to improve load balance across itera...
Jonathan Lifflander, Sriram Krishnamoorthy, Laxmik...