نتایج جستجو برای: critical path method

تعداد نتایج: 2161279  

2000
Tiina Niklander Kimmo E. E. Raatikainen

Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databases do. The most reprehensible feature is the volatility of the memory. In the RODAIN Database Architecture we solve this problem by maintaining a remote copy of the database in a stand-by node. We use logs to update the databas...

Journal: :Appl. Soft Comput. 2014
Parmpreet Kaur Amit Kumar

To the best of our knowledge, there is no method in the literature to find the fuzzy optimal solution of fully fuzzy critical path (FFCP) problems i.e., critical path problems in which all the parameters are represented by LR flat fuzzy numbers. In this paper, a new method is proposed for the same. Also, it is shown that it is better to use JMD representation of LR flat fuzzy numbers in the pro...

Journal: :IEEE Trans. Robotics and Automation 1993
Hirohiko Arai Kazuo Tanie Susumu Tachi

We present a method to control a manipulator with passive joints, which have no actuators, in operational space. The equation of motion is described in terms of operational coordinates. The coordinates are separated into active and passive components. The acceleration of the active components can be arbitrarily adjusted by using the coupling characteristics of manipulator dynamics. This method ...

2002
Isaac Pak-Wah Fung

This paper describes a scheme of adaptive advising students on how much time they should spend on traversing the course network. The scheme is based on the notion of critical path embodied in the network. While web-based online learning emphases student’s initiative in managing his own learning, experiences tell us that some students are always at the risk of being lost in the cyber campus. If ...

2006
Kuangyu Shi Holger Theisel Tino Weinkauf Helwig Hauser Hans-Christian Hege Hans-Peter Seidel

This paper presents an approach to extracting a path line oriented topological segmentation for periodic 2D timedependent vector fields. Topological methods aiming in capturing the asymptotic behavior of path lines rarely exist because path lines are usually only defined over a fixed time-interval, making statements about their asymptotic behavior impossible. For the data class of periodic vect...

Journal: :IEEE Trans. VLSI Syst. 2009
Ashkan Hosseinzadeh Namin Huapeng Wu Majid Ahmadi

A high speed word level finite field multiplier in F2m using redundant representation is proposed. For the class of fields that there exists a type I optimal normal basis, the new architecture has significantly higher speed compared to previously proposed architectures using either normal basis or redundant representation at the expense of moderately higher area complexity. One of the unique fe...

Journal: :IEEE Trans. Systems, Man, and Cybernetics 1989
Steven T. Hackman Robert C. Leachman

We consider the problem of dynamically allocating scarce resources to multiple projects in a project-oriented production system such as a naval shipyard. We formulate axioms governing the relationship between resource allocations and work progress of aggregate project activities, from which a model of project execution is derived. This model is more accurate than models which represent aggregat...

2007
CHEOL KIM BYUNG CHEOL KIM Kenneth F. Reinschmidt Stuart Anderson David Trejo Daren B.H. Cline David V. Rosowsky Byung Cheol Kim

Forecasting Project Progress and Early Warning of Project Overruns with Probabilistic Methods. (December 2007) Byung Cheol Kim, B.S., Seoul National University; M.S., Seoul National University Chair of Advisory Committee: Dr. Kenneth F. Reinschmidt Forecasting is a critical component of project management. Project managers must be able to make reliable predictions about the final duration and c...

Journal: :CoRR 2016
Camille Coti

This paper presents a fault-tolerant algorithm for the QR factorization of general matrices. It relies on the communication-avoiding algorithm, and uses the structure of the reduction of each part of the computation to introduce redundancies that are sufficient to recover the state of a failed process. After a process has failed, its state can be recovered based on the data held by one process ...

Journal: :Computers & Industrial Engineering 2013
Shwetank Avikal Rajeev Jain P. K. Mishra H. C. Yadav

The assembly line balancing problem is a non deterministic polynomial type planning problem for mass production. Layout design changes constitute a major decision that yields investment for assembly operations and numerous heuristics have been reported in the literature for solving the line balancing problems. U-shaped assembly layout offers several benefits over traditional straight-line layou...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید