An optimal IO sequence for the state J and the state K of a protocol, denoted as IO(J, K), is a shortest sequence of inputs which causes the protocol implementation in these two states to generate a different sequence...
详细信息
An optimal IO sequence for the state J and the state K of a protocol, denoted as IO(J, K), is a shortest sequence of inputs which causes the protocol implementation in these two states to generate a different sequence of outputs. Let n and m be the total number of states and transitions, respectively, and d(max) be the largest out-degree of any state;K. Sabnani and A.T. Dahbura proposed an algorithm to comp.te IO(J, K), J is given and K = 1, 2,..., n, with 0(n*(d(max)n + 2). This paper proposes a new algorithm to comp.te IO(J, K), J, K = 1, 2,..., n and J < K, with O(m2).
Intelligent System for Productivity Management (ISPM) facilitates management of productivity by setting appropriate strategic, tactical and operational objectives, measuring and comp.ring actual performance with targe...
详细信息
Intelligent System for Productivity Management (ISPM) facilitates management of productivity by setting appropriate strategic, tactical and operational objectives, measuring and comp.ring actual performance with targets and suggesting suitable control actions, as well as techniques for improvements, in case of deviations. Rayon industry is a labour intensive, continuous process chemical industry with a number of product varieties and intricate process conditions. ISPM is ideally suited for such an industry in view of the substantial benefits that can be derived by better management of productivity using ISPM. This paper presents a preliminary analysis for application of ISPM, as also details of operation and specimen outputs of the various modules of the system with examples.
A multiple stack branch and bound (MSBB) algorithm which uses a multiple stack data structure in order to reduce the overhead of selecting the most promising node in a best first search scheme is presented. A variatio...
详细信息
A multiple stack branch and bound (MSBB) algorithm which uses a multiple stack data structure in order to reduce the overhead of selecting the most promising node in a best first search scheme is presented. A variation of the algorithm MSBB is presented for providing an approximate solution with any prescribed bound on its cost of solution. Experiments were performed with the Euclidean traveling salesman problem.
Recently, there has been a lot of interest in planning the path of a robot in the present of obstacles. We present an optimal O(n log n) time algorithm to find the fastest path. The next section contains the basic def...
详细信息
Recently, there has been a lot of interest in planning the path of a robot in the present of obstacles. We present an optimal O(n log n) time algorithm to find the fastest path. The next section contains the basic definitions and properties. In Section 3, we explain how to replace the moving obstacles with stationary obstacles and give the modifications to be made to Lee and Preparata's algorithm.
It is well known that to find the k largest elements (and their rankings) of n real numbers, n + (k - 1) log n + O(1) comp.risons are both necessary and sufficient. A. Yao recently showed that if queries of the form x...
详细信息
It is well known that to find the k largest elements (and their rankings) of n real numbers, n + (k - 1) log n + O(1) comp.risons are both necessary and sufficient. A. Yao recently showed that if queries of the form xi - xj i - xj)(xj - xk) iaixi iaixi) (∑ibixi) < 0 are used.
Factors driving the growth of parallel comp.ting and those inhibiting its growth are identified. The impact of advances in communication, VLSI technology, and embedded systems on parallel architecture are discussed. T...
详细信息
Factors driving the growth of parallel comp.ting and those inhibiting its growth are identified. The impact of advances in communication, VLSI technology, and embedded systems on parallel architecture are discussed. The two categories of parallel programs-transformational and reactive-are examined. The use of templates and libraries is considered. Reasoning about parallel processes in the context of software design is discussed. Programming environments and operating systems support are addressed.
Farber and Keil presented an O(n3) algorithm for finding a minimum weight dominating set on permutation graphs. In this paper, we take a new approach for solving the same problem. The algorithm takes O(n(m + n)) steps...
详细信息
Farber and Keil presented an O(n3) algorithm for finding a minimum weight dominating set on permutation graphs. In this paper, we take a new approach for solving the same problem. The algorithm takes O(n(m + n)) steps, where m is the number of edges in a permutation graph G of n nodes. Therefore, our algorithm is particularly good for the sparse permutation graphs.
The multisearch problem consists of efficiently performing O(n) search processes on a data structure modeled as a graph G with n constant-degree nodes. Denote by r the length of the longest search path associated with...
详细信息
ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, p...
详细信息
ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.
ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, p...
详细信息
ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a “Full Text” option. The original article is trackable via the “References” option.
暂无评论