Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
Abstract. In this paper, a new Grid security framework based on dynamic access control is introduced to address some security problem in Grid. Based on the dynamic evaluating resul...
In this paper the phonetic and speech corpus DIMEx100 for Mexican Spanish is presented. We discuss both the linguistic motivation and the computational tools employed for the desig...
A new gradient-based routing protocol is proposed in this paper. It takes into account the minimum hop count and remaining energy of each node while relaying data from source node ...