Models of sequential-parallel arrangement of transport operations
نویسندگان
چکیده
منابع مشابه
determination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولRelations Among Parallel and Sequential Computation Models
This paper relates uniform small-depth circuit families as a parallel computation model with the complexity of polynomial time Turing machines. Among the consequences we obtain are: (a) a collapse of two circuit classes is equivalent to a relativizable collapse of the two corresponding polynomial time classes; and (b) a collapse of uniformity conditions for small depth circuits is equivalent to...
متن کاملthe application of multivariate probit models for conditional claim-types (the case study of iranian car insurance industry)
هدف اصلی نرخ گذاری بیمه ای تعیین نرخ عادلانه و منطقی از دیدگاه بیمه گر و بیمه گذار است. تعین نرخ یکی از مهم ترین مسایلی است که شرکتهای بیمه با آن روبرو هستند، زیرا تعیین نرخ اصلی ترین عامل در رقابت بین شرکتها است. برای تعیین حق بیمه ابتدا می باید مقدار مورد انتظار ادعای خسارت برای هر قرارداد بیمه را برآورد کرد. روش عمومی مدل سازی خسارتهای عملیاتی در نظر گرفتن تواتر و شدت خسارتها می باشد. اگر شر...
15 صفحه اولMinimum Linear Arrangement of Series-Parallel Graphs
We present a factor 14D approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(|E|) and is very easy to implement. Its divide-andconquer approach allows for an effective parallelization. Note that a suitable decomposition can also be comput...
متن کاملSequential Operations in LogicWeb
Sequential tasks cannot be effectively handled in logic programming based on classical logic or linear logic. This limitation can be addressed by using a fragment of Japaridze’s computability logic. We propose SeqWeb, an extension to LogicWeb with sequential goal formulas. SeqWeb extends the LogicWeb by allowing goals of the form G∧s G and G∨s G where G is a goal. These goals allow us to specif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Zhytomyr State Technological University. Series: Engineering
سال: 2017
ISSN: 1728-4260
DOI: 10.26642/tn-2017-2(80)-159-165