This paper presents an improvement of the Orthogonal Dynamic Programming optical flow technique that permits a better use of all the available information during the iterative search of the vector field in the case of stereo PIV. The two-component apparent vector fields are computed simultaneously (synchronously) for all available viewpoints. Coherency constraints issued from the geometry of th...

We report on work towards exible algorithms for solving decision problems represented as in uence diagrams An algorithm is given to construct a tree structure for each decision node in an in uence diagram Each tree represents a decision function and is constructed incrementally The decision maker can balance the cost of comput ing the next incremental improvement to a tree against the expected ...

In this paper the construction of optimal B-trees for n keys, n key weights, and n+1 gap weights, is investigated. The best algorithms up to now have running time O(k n log n), where k is the order of the B-tree. These algorithms are based on dynamic programming and use step by step construction of larger trees from optimal smaller trees. We present a new algorithm, which has running time O(k n...

In this paper, two problems on domino logic synthesis are addressed. A mapping method that maps the complementary logic cones independently when AND/OR logic is to be implemented, and together using dual-monotonic gates in the case of XOR/XNOR logic, is proposed. The results show up to 28.9% improvement in area and always show the same or better performance in delay over existing approaches. Th...

data envelopment analysis (dea) is a managerial powerful tool for assess the performance of decision making units (dmus). nowadays, multi-objective dea models are an attractive technique for evaluation quantity and quality aspects of performance analysis. but these models are in static. in this paper, we want to present a proposed fuzzy dynamic multi-objective dea model in which data are changi...

Two new molecular algorithms are presented that are designed for the improvement of ee-ciency and reliability of DNA computing. The rst algorithm introduces an evolutionary cycle to guide chemical reactions of DNA molecules. The second molecular algorithm extends the rst one by adding another evolutionary loop for optimizing encodings of the problem instance. Just as genetic programming is a me...

Functional logic languages combine lazy (demand-driven) evaluation strategies from functional programming with non-deterministic computations from logic programming. The lazy evaluation of non-deterministic subexpressions results in a demand-driven exploration of the search space: if the value of some subexpression is not required, the complete search space connected to it is not explored. On t...

one of the most important problems in the system reliability optimization is redundancy allocation problem that has been studied in different system configurations. k-out-of-n structure is a general system configuration and offers enhanced capabilities for analyzing more design problems. hence, in this paper, the redundancy allocation problem of k-out-of-n systems is studied. in the most previo...