This paper intends to investigate the relationship between the data density and the search operator rates in the examination room assignment problem. For this, we have suggested the Matrix-based EAs Model to solve the examination room assignment problem. In this particular problem, we allocate examinations into a number of rooms for a particular slot. Thus, data density in this paper refers to ...

I study large random assignment economies with a continuum of agents and a …nite number of object types. I consider the existence of weak priorities discriminating among agents with respect to their rights concerning the …nal assignment. The respect for priorities ex ante (ex-ante stability) usually precludes ex-ante envy-freeness. Therefore I de…ne a new concept of fairness, called no unjusti…...

Message passing is the primary programming model utilized for distributed memory systems. Because it aims at performance, the level of abstraction is low, making distributed memory programming often difficult and error-prone. In this paper, we leverage the expressivity and meta-programming capabilities of the C++ language to raise the abstraction level and simplify message passing programming. ...

We introduce a symmetric operad whose algebras are the Operator Product Expansion (OPE) Algebras of quantum fields. There is natural classical limit for over this and they commutative associative with derivations. The latter In paper we completely develop our approach to models fields, which come from vertex in higher dimensions. However, OPE can be extended general fields even curved space-tim...

syntax tree, 13annotated, 13addarray, 40, 41addarrays, 41addclass, 26, 55addobj, 26algebraic specifications, 23allsupers, 32antecedent, 63array accessproof rule, 78semantics, 35array assignmentproof rule, 79semantics, 37array creationproof rule, 81semantics, 40array initializerproof rule, 82semantics, 41ArrayAcc...

Design of Cellular Manufacturing System involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA).  These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. In this paper a two stage heuristic procedure is proposed for CF and RA decisions problem. The solution approach contains a ...

This paper considers a genetic algorithm (GA) for a machine-job assignment with controllable processing times (MJACPT). Integer representation with standard genetic operators is used. In an objective function, a job assignment is obtained from genetic code and for this, fixed assignment processing times are calculated by solving a constrained nonlinear convex optimization problem. Additionally,...

Augmenting genetic algorithms with local search heuristics is a promising approach to the solution of combinatorial optimization problems. In this paper, a genetic local search approach to the quadratic assignment problem (QAP) is presented. New genetic operators for realizing the approach are described, and its performance is tested on various QAP instances containing between 30 and 256 facili...

In a WCDMA Node-B, orthogonal variable spreading factor (OVSF) codes are both valuable and limited. Many efforts are being made to create OVSF code-assignment schemes that support a maximum number of users. Here the author (a) proposes a batch arrival and partial loss queuing model to evaluate OVSF single-code assignment system performance, and (b) derives expressions for calculating two import...