Results 281 to 290 of about 55,618 (308)
Some of the next articles are maybe not open access.
Inverting and Minimalizing Path Sets and Cut Sets
IEEE Transactions on Reliability, 1978This paper describes a technique for generating the minimal cuts from the minimal paths, or vice versa, for s-coherent systems. The process is a recursive 2-stage expansion based upon de Morgan's theorems; ie, it is the inversion of a Boolean polynomial having all common-valued (either all 0 or all 1) components, so that the inverse also has only ...
openaire +1 more source
Inverting Paths & Cuts of 2-State Systems
IEEE Transactions on Reliability, 1983Summary: An algorithm (INMIN) derives the path sets of 2-state systems from their cut sets and vice versa. This algorithm is extended to invert min paths and min cuts using the monotonicity of s-coherent systems. The handling of sets for these algorithms can easily be programmed in PASCAL using the SET-concept of this language.
openaire +1 more source
Cutting Path Planning for Surface Impellers
2011 Third International Conference on Measuring Technology and Mechatronics Automation, 20115-axis CNC machining is one kind not only may realize the ordinary machining, but may also complete from the rough cutting to the post processing entire flow new cutting way. This article develops special software to plan cutting path for ruled surface impellers.
Pengmin Dong +2 more
openaire +1 more source
Path Planning For A Class Of Cutting Operations
SPIE Proceedings, 1989Optimizing processing time in some contour-cutting operations requires solving the so-called no-load path problem. This problem is formulated and an approximate resolution method (based on heuristic search techniques) is described. Results for real-life instances (clothing layouts in the apparel industry) are presented and evaluated.
openaire +1 more source
Cutting a Path in Genetics and International Diplomacy
Science, 2004RICHARD VILLEMS PROFILETARTU, ESTONIA-- The newly elected president of the Estonian Academy of Sciences has long been a scientist-diplomat, first in dealings with the Soviet Union, now with the European Union.
openaire +1 more source
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing
2005In the valley-free path model, a path in a given directed graph is valid if it consists of a sequence of forward edges followed by a sequence of backward edges. This model is motivated by BGP routing policies of autonomous systems in the Internet. Robustness considerations lead to the problem of computing a maximum number of disjoint paths between two ...
Thomas Erlebach +3 more
openaire +1 more source
An improvement heuristic framework for the laser cutting tool path problem
International Journal of Production Research, 2015Reginald Dewil +2 more
exaly