46 articles for “Partitioning”

Set a search alert

Research ArticleOpen accessIn the abstractA Heapify Based Parallel Sorting AlgorithmM. A.A.A. Hija, A. Zabian, S. Qawasmeh, O. H.A.A. HaijaQuick sort is a sorting algorithm whose worst case running time is θ(n2) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,766 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEvaluation of some by-Products using In situ and In vitro Gas Production TechniquesBesharati Maghsoud, Taghizadeh Akbar, Janmohammadi Hossein, Moghadam Gholam AliFood by-products in Iran are produced in high levels. In this study, in situ and in vitro gas production techniques were used to describe nutritive value of apple pomace, tomato pomace and noodle waste. For this purpose two ruminal fistulated sheep were used. Nylon bags which were approximately (6×12 cm) containing 5 g samples (2 mm screen) were incubated in … …American Journal of Animal and Veterinary Sciences, Vol. 3, Issue 1 · 31 Mar 2008 · 6,945 accessesView PDF Cite

Research ArticleOpen accessIn the abstractDynamic Head Cluster Election Algorithm for Clustered Ad-Hoc NetworksArwa Zabian, Ahmed Ibrahim, Fadi Al-KalaniIn distributed system, the concept of clustering consists on dividing the geographical area covered by a set of nodes into small zones. In mobile network, the clustering mechanism varied due to the mobility of the nodes any time in any direction. That causes the partitioning of the network or the joining of nodes. Several existing centralized or globalized algorithm have … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 7,430 accessesView PDF Cite

Research ArticleOpen accessIn the abstractOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEfficient Physical Organization of R-Trees Using Node ClusteringF. Sagayaraj Francis, P. ThambiduraiR-Tree is a multidimensional indexing structure that forms basis for all the multidimensional indexing structures based on data partitioning. A number of attempts have been made in the past to improve the performance of R-Tree by manipulating the tree parameters and the data parameters. But hardly any attempt had been made to use external parameters such as disk parameters to … …Journal of Computer Science, Vol. 3, Issue 7 · 31 Jul 2007 · 6,627 accessesView PDF Cite

Research ArticleOpen accessIn the abstractFrom Design Specification to SystemCRachid Boudour, Mohamed T. KimourIn this paper, we present a framework for transforming the design model into SystemC code. Such a framework uses as input UML state machine and object diagrams, which are more and more used as design models in embedded systems. To do this, we have firstly used Poseidon tool for editing the design model and generating the XMI representation, and secondly … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 7,202 accessesView PDF Cite