Matrix completion aims to recover an unknown low-rank matrix from a small subset of its entries. In many applications, the rank target is known in advance and this information can be useful process. paper, first, we revisit recently proposed rank-based heuristic for “known-rank” establish condition under which generated sequence quasi-Fejér convergent solution set. Then, by including accelerati...

This paper presents a novel three-phase heuristic/algorithmic approach for the multi-depot routing problem with time windows and heterogeneous vehicles. It has been derived from embedding a heuristic-based clustering algorithm within a VRPTW optimization framework. To this purpose, a rigorous MILP mathematical model for the VRPTW problem is first introduced. Likewise other optimization approach...

The feasibility of symbolic learning strongly relies on the efficiency of heuristic search in the hypothesis space. However, recent works in relational learning claimed that the phase transition phenomenon which may occur in the subsumption test during search acts as a plateau for the heuristic search, strongly hindering its efficiency. We further develop this point by proposing a learning prob...

The order in which the variables are assigned can have an enormous impact on the time taken by a backtracking search algorithm to solve a constraint satisfaction problem (CSP). The Br elaz heuristic is a dynamic variable ordering heuristic which has been shown to give good results for some classes of binary CSPs when the constraint graph is not complete. Its advantage over the simpler smallest-...

This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the criterion of minimizing total completion time. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A new ranking method is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computat...

Practical machine translation must be considered from a heuristic point of view rather than from a purely rigid analytical l inguistic method. An English-into-Japanese translation system named ATHENE based on a Heuristic Parsing Model (HPM) has been developed. The experiment shows some advantageous points such as simplification of transforming and generating phase, semilocalization of multiple ...

Improved Formulations, Heuristics and Metaheuristics for the Dynamic Demand Coordinated Lot-sizing Problem. (August 2006) Arunachalam Narayanan, B.E., Anna University, India; M.S., Texas A&M University Chair of Advisory Committee: Dr. E. Powell Robinson Coordinated lot sizing problems, which assume a joint setup is shared by a product family, are commonly encountered in supply chain contexts. T...

We investigate the effect of noise on phase synchronization of coupled chaotic oscillators. It is found that additive white noise can induce phase slips in integer multiples of 2p’s in parameter regimes where phase synchronization is observed in the absence of noise. The average time duration of the temporal phase synchronization scales with the noise amplitude in a way that can be described as...

Practical machine translation must be considered from a heuristic point of view rather than from a purely rigid analytical l inguistic method. An English-into-Japanese translation system named ATHENE based on a Heuristic Parsing Model (HPM) has been developed. The experiment shows some advantageous points such as simplification of transforming and generating phase, semilocalization of multiple ...