In this paper, we introduce a multi-stage decoding algorithm optimized to recognize very large number of entry names on a resource-limited embedded device. The multi-stage decoding algorithm is composed of a two-stage HMM-based coarse search and a detailed search. The two-stage HMM-based coarse search generates a small set of candidates that are assumed to contain a correct hypothesis with high...

The sequential Branch and Bound Algorithm is the most established method for solving Mixed Integer and Discrete Programming Problems. It is based on the tree search of the possible subproblems of the original problem. There are two goals in carrying out a tree search, namely, (i) nding a good and ultimately the best integer solution, and (ii) to prove that the best solution has been found or no...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

data envelopment analysis is a nonparametric technique checking efficiency of dmus using math programming. in conventional dea, it has been assumed that the status of each measure is clearly known as either input or output. kao and hwang (2008) developed a data envelopment analysis (dea) approach for measuring efficiency of decision processes which can be divided into two stages. the first stag...