نتایج جستجو برای: sized problems
تعداد نتایج: 627272 فیلتر نتایج به سال:
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main goal of this paper is to provide an up-to-date review of the state-of-the-art in this challenging area. Main features, strengths a W q a t o l i ©
The single machine scheduling problem (SMSP) is a classic problem in optimisation which has been extensively studied over the past 60 years. To solve an instance of the problem a set of jobs must be scheduled on a single machine, so that at any time the machine is either idle or processing exactly one job. We consider a nonpreemptive version of this problem which requires that the processing of...
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network connecting several individual networks. In this paper we study the performance of six neighborhood search heuristics based on tabu search and variab...
We present a parallel cloth simulation engine designed for distributed memory parallel architectures, in particular clusters built of commodity components. We focus on efficient parallel processing of irregularly structured and real-world sized problems typically occurring in the simulation of garments. We report on performance measurements showing a high degree of parallel efficiency and scala...
Documentation for a manufacturing system can range from a few hundred pages for a medium sized industrial machine-tool to many thousands of individual manuals together with supporting drawings for a complete manufacturing plant. With this volume of information, and the change to multi-skilling of personnel within many industrial plants, a number of problems with conventional information retriev...
We introduce asymptotically optimal algorithms for gathering and scattering a small-to-moderate sized set of data on a coarse grained parallel computer. We use these operations to obtain efficient to optimal solutions to several fundamental problems in image processing and string matching (exact or approximate) for coarse grained parallel computers. © 2004 Elsevier Inc. All rights reserved.
Programs have been written to apply parallel processing algorithms to the main methods of DNA sequence analysis. These programs allow the largest of currently interesting problems to be handled on a medium-sized computer system. The abundance of information otherwise not readily available has suggested new methods for the detection of homology and order in sequences.
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
We describe a simple framework for micro simulation of city traac. A medium sized excerpt of Dallas was used to examine diierent levels of simulation delity of a cellular automaton method for the traac ow simulation and a simple intersection model. We point out problems arising with the granular structure of the underlying rules of motion.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید