نتایج جستجو برای: critical micelleconcentration

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

1998
Dean M. Tullsen Brad Calder

Modern processors come close to executing as fast as true dependencies allow. The particular dependencies that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual path. This paper describes ...

2018
Xiaofeng Cui

It is commonly recognized that the research on software architecture has enjoyed a golden age of innovation and concept formulation, and began to enter the mature stage of utilization. It is a natural expectation at present that the relevant concepts and methods have been populated and the improvements have been achieved in practice. In this paper, we give a retrospective report on our extensiv...

2015
Marek Galewski

We consider a functional being a difference of two differentiable convex functionals on a closed ball. Existence and multiplicity of critical points is investigated. Some applications are given.

Journal: :Australasian J. Combinatorics 1998
Odile Favaron Minyong Shi

A graph G of order n is k-factor-critical, where k is an integer of the same parity as n with 0 ::; k ::; n, if G X has a perfect matching for any set X of k vertices of G. A k-factor-critical graph G is called minimal if for any edge e E E(G), G e is not k-factor-critical. In this paper we study some properties of minimally k-factor-critical graphs, in particular a bound on the minimum degree,...

Journal: :Discrete Mathematics 2001
Ken-ichi Kawarabayashi Katsuhiro Ota Akira Saito

A graph G is said to be n-factor-critical if G − S has a 1-factor for any S ⊂V (G) with |S| = n. In this paper, we prove that if G is a 2-connected n-factor-critical graph of order p with 3(G)¿ 2 (p−n−1), then G is hamiltonian with some exceptions. To extend this theorem, we de6ne a (k; n)-factor-critical graph to be a graph G such that G − S has a k-factor for any S ⊂V (G) with |S| = n. We con...

2006
Tzeu-Chen Han Cheng-Chi Chung Gin-Shuh Liang

To cut down cost in a competitive environment, airlines must avoid delays and operation inefficiencies in both airside and landside. However, previous studies have paid little attention to an airlines’ ground operation in airports’ cargo terminals. The purpose of this paper is to demonstrate how to employ the Fuzzy Critical Path method (CPM) to find out airport’s ground critical operation proce...

Journal: :Modern Physics Letters B 1997

Journal: :Classical and Quantum Gravity 1994

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

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