نتایج جستجو برای: generalized implicit enumeration
تعداد نتایج: 220967 فیلتر نتایج به سال:
In this paper, we introduce a new class of generalized implicit vector variational-like inequalities in Hausdorff topological vector spaces and Banach spaces which contain implicit vector equilibrium problems, implicit vector variational inequalities and implicit vector complementarity problems as special cases. We derive some new results by using the KKM–Fan theorem, under compact and noncompa...
This paper addresses a static, n-job, single-machine scheduling problem with sequence dependent family setups. The setup matrix follows a special structure where a constant setup is required only if a job from a smaller indexed family is an immediate successor of one from a larger indexed family. The objective is to minimize the maximum lateness (Lmax). A two-step neighborhood search procedure ...
Fault diagnosis is to predict the potential fault sites in a logic IC. In this paper, we particularly address the problem of diagnosing faults that exhibit the so-called Byzantine General’s phenomenon, in which a fault manifests itself as a non-logical voltage level at the fault site. Previously, explicit enumeration was suggested to deal with such a problem. However, it is often too time-consu...
People are able to explicitly resist using knowledge about one person to evaluate another person from the same group. After learning about positive and negative behaviors performed by one individual from each of two different groups, participants were introduced briefly to new individuals from the groups. Implicit evaluations of the original individuals readily generalized to the new individual...
This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don’t caresets. Specifically, given an incompletely specified function g and a fixed ordering of the variables, we propose anexact algorithm for selectingf such that f is a cover for g and the binary decision diagram for f is of minimumsize. The approach described is the only kn...
This paper addresses the problem of Boolean decision diagram (BDD) minimization in the presence of don't care sets. Speciically, given an incompletely speciied function g and a xed ordering of the variables, we propose an exact algorithm for selecting f such that f is a cover for g and the Boolean decision diagram for f is of minimum size. The approach described is the only known exact algorith...
This paper addresses the problem of binary decision diagram (BDD) minimization in the presence of don’t care sets. Specifically, given an incompletely specified function and a fixed ordering of the variables, we propose an exact algorithm for selecting such that is a cover for and the binary decision diagram for is of minimum size. The approach described is the only known exact algorithm for th...
A formal correspondence is established between the curvature theory of generalized implicit hypersurfaces, the classical theory of electromagnetism as expressed in terms of exterior di®erential systems, and thermodynamics. Starting with a generalized implicit surface whose normal ̄eld is represented by an exterior di®erential 1-form, it is possible to deduce the curvature invariants of the impl...
A formal correspondence is established between the curvature theory of generalized implicit hypersurfaces, the classical theory of electromagnetism as expressed in terms of exterior differential systems, and thermodynamics. Starting with a generalized implicit surface whose normal field is represented by an exterior differential 1-form, it is possible to deduce the curvature invariants of the i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید