نتایج جستجو برای: desired ones

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

2004
Matthias Heinkenschloss Hoang Nguyen

We present Neumann-Neumann domain decomposition preconditioners for the solution of elliptic linear quadratic optimal control problems. The preconditioner is applied to the optimality system. A Schur complement formulation is derived that reformulates the original optimality system as a system in the state and adjoint variables restricted to the subdomain boundaries. The application of the Schu...

2001
Changli Jiao Loren Schwiebert

In the transport layer of the TCP/IP protocol suite, both TCP and UDP use internet checksum to protect headers and data. Internet checksum uses 1’s complement arithmetic to detect errors in the content delivered by the data-link layer. Both research and experience have shown that there are a wide variety of error sources which can not be detected by this lower layer. The error detecting perform...

2008
Saharon Shelah

We deal with the problem of preserving various versions of completeness in (< κ)–support iterations of forcing notions, generalizing the case “S–complete proper is preserved by CS iterations for a stationary costationary S ⊆ ω1”. We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal κ and a stationary set S ⊆ κ with fat complement ...

Journal: :Genetics Selection Evolution 1980

Journal: :Genetics Selection Evolution 1980

Journal: :Journal of Synthetic Organic Chemistry, Japan 1992

1995
Felipe Maia Galvão França Luérbio Faria

The problem of nding the minimum topology of multipro-cessing substrates supporting parallel execution of any given neighbourhood constrained system is proposed and possible optimal strategies are investigated based on the relationship between Barbosa's scheduling by edge reversal-SER-distributed algorithm and the minimum clique covering problem. It is shown that from any given clique covering ...

2012
Andrew D. King Bruce A. Reed

The second author’s ω, ∆, χ conjecture proposes that every graph satisties χ ≤ d 1 2 (∆ + 1 + ω)e. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses the structure theorem of Chudnovsky and Seymour. Along the way we discuss a stronger local conjecture, and prove that it holds for claw-free graphs with a three-colourable complement. To prove our results ...

Journal: :Organization Science 2008
Michel Anteby

Research has long shown that organizations shape members’ identities. However, the possibility that these identities might also be desired and that members might benefit from this process has only recently been explored. In a qualitative study of a French aeronautic plant, I demonstrate how an implicitly negotiated leniency between management and workers around the use of company materials and ...

Journal: :Nihon Rinsho Geka Gakkai Zasshi (Journal of Japan Surgical Association) 2010

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

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