نتایج جستجو برای: conn

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

2017
Paul B. Conn Devin S. Johnson Perry J. Williams Sharon R. Melin Mevin B. Hooten

Paul B. Conn, Devin S. Johnson, Perry J. Williams, Sharon R. Melin, and Mevin B. Hooten Marine Mammal Laboratory, NOAA, National Marine Fisheries Service, Alaska Fisheries Science Center, 7600 Sand Point Way NE, Seattle, WA 98115 USA Department of Fish, Wildlife, and Conservation Biology, Colorado State University, Fort Collins, CO 80523 USA Department of Statistics, Colorado State University, ...

2016
David Norman Kim Rinehart

v. Papastavros, 323 Conn. 275 (Sept. 27, 2016), the Connecticut Supreme Court ruled that expert testimony is required to establish the element of causation in a legal malpractice case. Thus, even where an attorney’s performance was deficient, if the plaintiff cannot present expert testimony that the outcome of her case would have been different but for the attorney’s negligence, the attorney wi...

Journal: :Journal of bacteriology 1966
H Boyer

Boyer, Herbert (Yale University, New Haven, Conn.). Conjugation in Escherichia coli. J. Bacteriol. 91:1767-1772. 1966.-The sex factor of Escherichia coli K-12 was introduced into an E. coli B/r strain by circumventing the host-controlled modification and restriction incompatibilities known to exist between these closely related strains. The sexual properties of the constructed F(+) B strain and...

1995
Lorenz T. Biegler Jorge Nocedal

We propose a quasi-Newton algorithm for solving large optimization problems with nonlinear equality constraints. It is designed for problems with few degrees of freedom and is motivated by the need to use sparse matrix factorizations. The algorithm incorporates a correction vector that approximates the cross term Z T WY p Y in order to estimate the curvature in both the range and null spaces of...

Journal: :Proceedings of the American Institute of Electrical Engineers 1909

2014
Lorenzo Orecchia Zeyuan Allen Zhu

Given a subset A of vertices of an undirected graph G, the cut-improvement problem asks us to find a subset S that is similar to A but has smaller conductance. An elegant algorithm for this problem has been given by Andersen and Lang [AL08] and requires solving a small number of single-commodity maximum flow computations over the whole graph G. In this paper, we introduce LocalImprove, the firs...

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

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