Sequential multi-constraint graph partitioning algorithms have been developed to address the load balancing requirements of multi-phase simulations. The e cient execution of large multi-phase simulations on high performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a recently developed multi-constr...

Sequential multi-constraint graph partitioners have been developed to address the static load balancing requirements of multi-phase simulations. These work well when (i) the graph that models the computation fits into the memory of a single processor, and (ii) the simulation does not require dynamic load balancing. The efficient execution of very large or dynamically adapting multi-phase simula...

In Constraint Programming (CP), a portfolio solver uses a variety of different solvers for solving a given Constraint Satisfaction / Optimization Problem. In this paper we introduce sunny-cp2: the first parallel CP portfolio solver that enables a dynamic, cooperative, and simultaneous execution of its solvers in a multicore setting. It incorporates state-of-the-art solvers, providing also a usa...

inventory control problem is one of the problems in decision making and management that contains non-crisp parameters in real world. economic production quantity (epq) model in fuzzy environment has been studied so far by many researchers. one of the main assumptions in all previous researches was neglecting the inventory shortage. in this research, a new multi-item epq model with fuzzy random ...

Sequential multi-constraint graph partitioners have been developed to address the load balancing requirements of multi-phase simulations. The efficient execution of large multi-phase simulations on high performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a recently developed multi-constraint grap...

With the increasing interest in distributed and collaborative multi-agent applications, conflict resolution in largescale systems becomes an important problem. Our approach to collaborative conflict resolution is based on argumentation. To understand the feasibility and the scope of the approach, we first implemented the process in a system called CONSA and applied it to two complex, dynamic do...

Resource allocation is a form of Constraint Satisfaction Problem (CSP) in which a set of resources must be assigned to a set of agents. Multiagent Resource Allocation (MARA) makes possible solving CSP using qualitative parameters as, for example, reduce idle time in scheduling or preferences over the set of resources to be allocated. In this paper, we are going to use a MARA approach to find a ...

A signi cant source of di culty in language learning is the presumed \incompleteness" of the overt information available to a language learner, termed here an `overt form', when they hear an utterance. The complete structural description assigned to an utterance by linguistic analysis includes representational elements not directly apparent in the overt form, but which play a critical role in l...