Zobrazeno 1 - 10
of 13
pro vyhledávání: '"R M, Karp"'
Autor:
A. B. Rogers, Matthew T. Labenski, E. G. Doyle, E. J. Clark, D. D. Lazarus, R. M. Karp, W. F. Westlin, G. Hannig, S. G. Bernier, J. D. Wakefield, J. Lorusso, Charles D. Thompson, J. G. Hoyt
Publikováno v:
Inflammation Research. 57:18-27
To elucidate the role of methionine aminopeptidase type-2 (MetAP-2) in the clinical pathology of rheumatoid arthritis, arthritis was induced in rats by administration of peptidoglycan-polysaccharide (PG-PS).The inhibitor of MetAP-2, PPI-2458, was adm
Autor:
R. M. Karp
Publikováno v:
Theoretical Computer Science ISBN: 9783642111181
This series of lectures is concerned with efficient algorithms which operate on graphs. A graph is a structure consisting of a finite set of vertices, certain pairs of which are joined by edges. In an ordinary graph an edge has no direction specified
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2db44b7989fad2bec9a3bb61fb994c80
https://doi.org/10.1007/978-3-642-11120-4_3
https://doi.org/10.1007/978-3-642-11120-4_3
Publikováno v:
Biology of reproduction. 63(6)
Changes in mRNA expression for estrogen receptor (ER beta) in relation to mRNAs for LH receptor (LHr) and cytochrome P450 enzymes were examined in granulosa and theca cells from proestrous rat ovarian follicles. Of the 30 ovaries harvested from 15 ad
Publikováno v:
European Journal of Cancer Supplements. 4:109
Autor:
R. M. Karp
Publikováno v:
The Mathematics of Networks. :45-62
Autor:
J. Paul Roth, R. M. Karp
Publikováno v:
IBM Journal of Research and Development. 6:227-238
This paper presents a systematic procedure for thed esign of gate-type combinational switching circuits without diredted loops. Each such circuit (Boolean graph) is in correspondence with a sequence of decompositions of the Boolean function which it
Autor:
Alan J. Hoffman, R. M. Karp
Publikováno v:
Management Science. 12(5):359-370
A stochastic game is played in a sequence of steps; at each step the play is said to be in some state i, chosen from a finite collection of states. If the play is in state i, the first player chooses move k and the second player chooses move l, then
Autor:
M. Held, R. M. Karp
Publikováno v:
IBM Systems Journal. 4:136-147
Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed.
Autor:
M. Sipser, R. M. Karp
Publikováno v:
22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
Publikováno v:
Advances in Cryptology ISBN: 9781475706048
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2013f7dbe5fff0822e5edcbc3615d5
https://doi.org/10.1007/978-1-4757-0602-4_16
https://doi.org/10.1007/978-1-4757-0602-4_16