This paper attempts to overcome the local convergence problem of the Expectation Maximization (EM) based training of the Hidden Markov Model (HMM) in speech recognition. We propose a hybrid algorithm, Simulated Annealing Stochastic version of EM (SASEM), combining Simulated Annealing with EM that reformulates the HMM estimation process using a stochastic step between the EM steps and the SA. Th...

The Web newspaper pagination problem consists of optimizing the layout of a set of articles extracted from several Web newspapers and sending it to the user as the result of a previous query. This layout should be organized in columns, as in real newspapers, and should be adapted to the client Web browser configuration in real time. This paper presents an approach to the problem based on simula...

Piecewise continuous reconstruction of real-valued data can be formulated in terms of nonconvex optimization problems. Both stochastic and deterministic algorithms have been devised to solve them. The simplest such reconstruction process is the “weak string.” Exact solutions can be obtained for it, and are used to determine the success or failure of the algorithms under precisely controlled con...

the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...

In this study, we have classified different types of problems which are related to facility planning and layout design for different types of manufacturing processes. The main problems which are related to location of facilities which also affects the system performance such as distribution of man, material and machine in a plant or a factory and their optimization technique while using of math...

Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems. This paper presents some experiments of applying SA to an NP-hard problem, i.e., call routing in circuit-switched telecommunications networks. The call routing problem considered here can be described as assigning calls to paths in a network so that the number of calls blocked can be minim...