The Union between Structural and Practical Identifiability Makes Strength in Reducing Oncological Model Complexity: A Case Study

&
Complexity 2018:1-10 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1155/2018/2380650

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Absence Makes the Thought Grow Stronger: Reducing Structural Overlap Can Increase Inductive Strength.Hee Seung Lee & Keith J. Holyoak - 2008 - In B. C. Love, K. McRae & V. M. Sloutsky (eds.), Proceedings of the 30th Annual Conference of the Cognitive Science Society. Cognitive Science Society.
On the identifiability and estimation of functional causal models in the presence of outcome-dependent selection.Kun Zhang, Jiji Zhang, Biwei Huang, Bernhard Schölkopf & Clark Glymour - unknown
Connectionist hysteria: Reducing a Freudian case study to a network model.Dan Lloyd - 1994 - Philosophy, Psychiatry, and Psychology 1 (2):69-88.
Structural database for reducing cost in materials design and complexity of multiscale computations.Nikolai Zarkevich - 2006 - Complexity 11 (4):36-42.
Structural stability of a stage structured model of fish: The case of the anchovy (engraulis encrasicolus L.) in the Bay of biscay.Valère Calaud & Yvan Lagadeuc - 2005 - Acta Biotheoretica 53 (4):341-358.
A Test of Labor Union Social Responsibility: Effects on Union Member Attachment.Cedric E. Dawkins - 2016 - Business and Society 55 (2):214-245.
Unruly complexity: ecology, interpretation, engagement.Peter J. Taylor - 2005 - Chicago: University of Chicago Press.
Scaling in structural complexity.Valerio De Biagi & Bernardino Chiaia - 2014 - Complexity 20 (1):57-63.
On the Logic of Interrogative Inquiry.Jaakko Hintikka & Stephen Harris - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:233-240.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1-2):153-178.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1):153-178.
The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.
The Twofold Task of Union.Alexander Jech - 2014 - Ethical Theory and Moral Practice 17 (5):987-1000.
Increasing complexity by reducing complexity: A Luhmannian approach to learning.Jens Rasmussen - 2010 - In Deborah Osberg & Gert Biesta (eds.), Complexity Theory and the Politics of Education. Sense Publishers. pp. 15--24.
The Structural Determination of Case and Agreement.Maria Bittner & Ken Hale - 1996 - Linguistic Inquiry 27 (1):1–68.

Analytics

Added to PP
2018-02-13

Downloads
21 (#718,251)

6 months
12 (#200,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references