Summarizing skills have been introduced to English syllabus in secondary school in Malaysia to evaluate student’s comprehension for a given text where it requires students to employ several strategies to produce the summary. This paper reports on our effort to develop a computer-based summarization assessment system that detects the strategies used by the students in producing their summaries. ...

Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...

In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

This paper proposes a heuristic algorithm for linear decomposition of index generation functions using a balanced decision tree. The proposed algorithm finds a good linear decomposition of an index generation function by recursively dividing a set of its function values into two subsets with balanced size. Since the proposed algorithm is fast and requires a small amount of memory, it is applica...

In this work, we propose a heuristic algorithm based on Genetic Algorithm for the task-to-processor mapping problem in the context of local-memory multiprocessors with a hypercube interconnection topology. Hypercube multiprocessors have offered a cost effective and feasible approach to supercomputing through parallelism at the processor level by directly connecting a large number of low-cost pr...

A Two-phase model for configuring a cellular manufacturing system is proposed. In phase (I), for the first time, number of cells is considered as a decision variable. In phase (II), pursing two different objectives, one minimization of underload and the other, maximization of similarity of parts within a group, the design procedure is performed. As one cannot have these two objects together, a ...

In this study an efficient meta-heuristic is proposed for layout optimization of truss structures by combining cellular automata (CA) and firefly algorithm (FA). In the proposed meta-heuristic, called here as cellular automata firefly algorithm (CAFA), a new equation is presented for position updating of fireflies based on the concept of CA. Two benchmark examples of truss structures are presen...

The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when...

In this paper, we investigate a method to decompose the search space explored by a Constraint Programming algorithm to allow a parallel solution of a Constraint Satisfaction or Optimization Problem (CSP or COP). The static tree decomposition used is based on domain partitioning according to a value ordering heuristic and a discrepancybased search strategy. This work is a parallel adaptation of ...