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 ...

We propose a heuristic for the construction of variable-stride multibit tries. These multibit tries are suitable for one-dimensional packet classification using a pipelined architecture. The variable-stride tries constructed by our heuristic require significantly less per-stage memory than required by optimal pipelined fixed-stride tries. We also develop a tree packing heuristic, which dramatic...

Hierarchical clustering is a popular method for grouping together similar items based on a distance measure between them. These clusters can be used to infer annotations for uncharacterized items. However, in many cases, annotation information for some elements is known beforehand. We present a novel approach for decomposing a hierarchical clustering into the optimal clusters that match a set o...

Dust modeling is highly computing intensive, and is normally executed through decomposition approach, by decomposing model domain evenly into multiple or many subdomains, which are then allocated to multiple computing nodes. The cost of data transfer due to communication among neighbor subdomains is a key efficiency issue because it adds significant overhead. In this research, two scheduling me...

In this work we show the de ciencies of the graph model for decomposing sparse matrices for parallel matrix vector multiplica tion Then we propose two hypergraph models which avoid all de cien cies of the graph model The proposed models reduce the decomposition problem to the well known hypergraph partitioning problem widely en countered in circuit partitioning in VLSI We have implemented fast ...

Planning as Satisfiability is an important approach to Propositional Planning. A serious drawback of the method is its limited scalability, as the instances that arise from large planning problems are often too hard for modern SAT solvers. This work tackles this problem by combining two powerful techniques that aim at decomposing a planning problem into smaller subproblems, so that the satisfia...

This paper presents a method for decomposing long, complex consumer health questions. Our approach largely decomposes questions using their syntactic structure, recognizing independent questions embedded in clauses, as well as coordinations and exemplifying phrases. Additionally, we identify elements specific to disease-related consumer health questions, such as the focus disease and background...

Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manufacturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on similarities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Opt...

We present an empirical analysis of some heuristics for the graph thickness problem, i.e., decomposing a graph into the minimum number of planar subgraphs. The problem has applications in database systems, e.g., the layout of E-R diagrams. The heuristics are based on some algorithms for nding a maximal planar subgraph of a nonplanar graph. Empirical results show that a randomized heuristic is a...