Auswahl der wissenschaftlichen Literatur zum Thema „Exact and approximate inferences“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Exact and approximate inferences" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Exact and approximate inferences"
Wu, Lang. „Exact and Approximate Inferences for Nonlinear Mixed-Effects Models With Missing Covariates“. Journal of the American Statistical Association 99, Nr. 467 (September 2004): 700–709. http://dx.doi.org/10.1198/016214504000001006.
Der volle Inhalt der QuelleMekhnacha, Kamel, Juan-Manuel Ahuactzin, Pierre Bessière, Emmanuel Mazer und Linda Smail. „Exact and approximate inference in ProBT“. Revue d'intelligence artificielle 21, Nr. 3 (12.06.2007): 295–332. http://dx.doi.org/10.3166/ria.21.295-332.
Der volle Inhalt der QuelleAkagi, Yasunori, Takuya Nishimura, Yusuke Tanaka, Takeshi Kurashima und Hiroyuki Toda. „Exact and Efficient Inference for Collective Flow Diffusion Model via Minimum Convex Cost Flow Algorithm“. Proceedings of the AAAI Conference on Artificial Intelligence 34, Nr. 04 (03.04.2020): 3163–70. http://dx.doi.org/10.1609/aaai.v34i04.5713.
Der volle Inhalt der QuelleAbe, Takayuki, und Manabu Iwasaki. „EXACT AND APPROXIMATE INFERENCES FOR AN EXPONENTIAL MEAN FROM TYPE I CENSORED DATA“. Bulletin of informatics and cybernetics 37 (Dezember 2005): 31–39. http://dx.doi.org/10.5109/12589.
Der volle Inhalt der QuelleYANG, HANN-PYI JAMES, und WEI-KEI SHIUE. „COMPARISON OF FAILURE INTENSITIES FROM TWO POISSON PROCESSES“. International Journal of Reliability, Quality and Safety Engineering 02, Nr. 03 (September 1995): 235–43. http://dx.doi.org/10.1142/s0218539395000186.
Der volle Inhalt der QuelleKarami, Md Jamil Hasan. „Assessing Goodness of Approximate Distributions for Inferences about Parameters in Nonlinear Regression Model“. Dhaka University Journal of Science 71, Nr. 1 (29.05.2023): 13–16. http://dx.doi.org/10.3329/dujs.v71i1.65267.
Der volle Inhalt der QuelleEl-Sagheer, Rashad M., Taghreed M. Jawa und Neveen Sayed-Ahmed. „Inferences for Generalized Pareto Distribution Based on Progressive First-Failure Censoring Scheme“. Complexity 2021 (07.12.2021): 1–11. http://dx.doi.org/10.1155/2021/9325928.
Der volle Inhalt der QuelleLintusaari, Jarno, Paul Blomstedt, Tuomas Sivula, Michael U. Gutmann, Samuel Kaski und Jukka Corander. „Resolving outbreak dynamics using approximate Bayesian computation for stochastic birth-death models“. Wellcome Open Research 4 (25.01.2019): 14. http://dx.doi.org/10.12688/wellcomeopenres.15048.1.
Der volle Inhalt der QuelleLintusaari, Jarno, Paul Blomstedt, Brittany Rose, Tuomas Sivula, Michael U. Gutmann, Samuel Kaski und Jukka Corander. „Resolving outbreak dynamics using approximate Bayesian computation for stochastic birth–death models“. Wellcome Open Research 4 (30.08.2019): 14. http://dx.doi.org/10.12688/wellcomeopenres.15048.2.
Der volle Inhalt der QuelleShapovalova, Yuliya. „“Exact” and Approximate Methods for Bayesian Inference: Stochastic Volatility Case Study“. Entropy 23, Nr. 4 (15.04.2021): 466. http://dx.doi.org/10.3390/e23040466.
Der volle Inhalt der QuelleDissertationen zum Thema "Exact and approximate inferences"
Ducamp, Gaspard. „PROCOP : probabilistic rules compilation and optimisation“. Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS090.
Der volle Inhalt der QuelleWidely adopted for more than 20 years in industrial fields, business rules offer the opportunity to non-IT users to define decision-making policies in a simple and intuitive way. To facilitate their use, rule-based systems, known as business rule management systems, have been developed, separating the business logic from the computer application. While they are suitable for processing structured and complete data, they do not easily allow working with probabilistic data. PROCOP (Probabilistic Rules Optimized and COmPilation) is a thesis proposing a new approach for the integration of probabilistic reasoning in IBM Operational Decision Manager (ODM), IBM's business rules management system, in particular through the introduction of a concept of global risk on the evaluation of the execution conditions of an action, complicating the compilation phase of the system but increasing the expressiveness of the business rules. Various methods are explored, implemented and compared in order to allow the use of such a powerful reasoning capacity on a large scale, in particular in order to answer the problems linked to the use of probabilistic graphical models in complex networks
Tucker, Dewey S. (Dewey Stanton). „Stochastic realization theory for exact and approximate multiscale models“. Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34468.
Der volle Inhalt der QuelleIncludes bibliographical references (p. [245]-252).
The thesis provides a detailed analysis of the independence structure possessed by multiscale models and demonstrates that such an analysis provides important insight into the multiscale stochastic realization problem. Multiscale models constitute a broad class of probabilistic models which includes the well--known subclass of multiscale autoregressive (MAR) models. MAR models have proven useful in a variety of different application areas, due to the fact that they provide a rich set of tools for various signal processing tasks. In order to use these tools, however, a MAR or multiscale model must first be constructed to provide an accurate probabilistic description of the particular application at hand. This thesis addresses this issue of multiscale model identification or realization. Previous work in the area of MAR model identification has focused on developing algorithms which decorrelate certain subsets of random vectors in an effort to design an accurate model. In this thesis, we develop a set-theoretic and graph-theoretic framework for better understanding these types of realization algorithms and for the purpose of designing new such algorithms.
(cont.) The benefit of the framework developed here is that it separates the realization problem into two understandable parts - a dichotomy which helps to clarify the relationship between the exact realization problem, where a multiscale model is designed to exactly satisfy a probabilistic constraint, and the approximate realization problem, where the constraint is only approximately satisfied. The first part of our study focuses on developing a better understanding of the independence structure exhibited by multiscale models. As a result of this study, we are able to suggest a number of different sequential procedures for realizing exact multiscale models. The second part of our study focuses on approximate realization, where we define a relaxed version of the exact multiscale realization problem. We show that many of the ideas developed for the exact realization problem may be used to better understand the approximate realization problem and to develop algorithms for solving it. In particular, we propose an iterative procedure for solving the approximate realization problem, and we show that the parameterized version of this procedure is equivalent to the well-known EM algorithm. Finally, a specific algorithm is developed for realizing a multiscale model which matches the statistics of a Gaussian random process.
by Dewey S. Tucker.
Ph.D.
Cabo, Nodar Marta. „Exact and approximate algorithms for the inventory routing problem“. Thesis, University of Southampton, 2003. https://eprints.soton.ac.uk/50599/.
Der volle Inhalt der QuelleAhern, Zeke Alexander. „Exact and approximate optimisation for strategic bus network planning“. Thesis, Queensland University of Technology, 2020. https://eprints.qut.edu.au/206458/1/Zeke_Ahern_Thesis.pdf.
Der volle Inhalt der QuelleMarkovsky, Ivan. „Exact and approximate modeling of linear systems : a behavioral approach /“. Philadelphia, Pa. : Society for Industrial and Applied Mathematics, 2006. http://www.loc.gov/catdir/enhancements/fy0708/2005057537-d.html.
Der volle Inhalt der QuelleTaylor, Michael. „Exact and approximate epidemic models on networks : theory and applications“. Thesis, University of Sussex, 2013. http://sro.sussex.ac.uk/id/eprint/45258/.
Der volle Inhalt der QuelleIgwe, Tobenna. „An empirical study on computation of exact and approximate equilibria“. Thesis, University of Liverpool, 2018. http://livrepository.liverpool.ac.uk/3016935/.
Der volle Inhalt der QuelleDiaz, Bobillo Ignacio Javier. „The general â₁ optimal multiblock problem : exact and approximate solutions“. Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12798.
Der volle Inhalt der QuelleIncludes bibliographical references (leaves 119-123).
by Ignacio Javier Diaz-Bobillo.
Ph.D.
Hassan, Abdeljabbar Hassan Mohammed Albarra. „Parallel Scheduling in the Cloud Systems : Approximate and Exact Methods“. Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0223/document.
Der volle Inhalt der QuelleThe Cloud Computing appears as a strong concept to share costs and resources related to the use of end-users. As a consequence, several related models exist and are widely used (IaaS, PaaS, SaaS. . .). In this context, our research focused on the design of new methodologies and algorithms to optimize performances using the scheduling and combinatorial theories. We were interested in the performance optimization of a Cloud Computing environment where the resources are heterogeneous (operators, machines, processors...) but limited. Several scheduling problems have been addressed in this thesis. Our objective was to build advanced algorithms by taking into account all these additional specificities of such an environment and by ensuring the performance of solutions. Generally, the scheduling function consists in organizing activities in a specific system imposing some rules to respect. The scheduling problems are essential in the management of projects, but also for a wide set of real systems (telecommunication, computer science, transportation, production...). More generally, solving a scheduling problem can be reduced to the organization and the synchronization of a set of activities (jobs or tasks) by exploiting the available capacities (resources). This execution has to respect different technical rules (constraints) and to provide the maximum of effectiveness (according to a set of criteria). Most of these problems belong to the NP-Hard problems class for which the majority of computer scientists do not expect the existence of a polynomial exact algorithm unless P=NP. Thus, the study of these problems is particularly interesting at the scientific level in addition to their high practical relevance. In particular, we aimed to build new efficient combinatorial methods for solving parallel-machine scheduling problems where resources have different speeds and tasks are linked by precedence constraints. In our work we studied two methodological approaches to solve the problem under the consideration : exact and meta-heuristic methods. We studied three scheduling problems, where the problem of task scheduling in cloud environment can be generalized as unrelated parallel machines, and open shop scheduling problem with different constraints. For solving the problem of unrelated parallel machines with precedence constraints, we proposed a novel genetic-based task scheduling algorithms in order to minimize maximum completion time (makespan). These algorithms combined the genetic algorithm approach with different techniques and batching rules such as list scheduling (LS) and earliest completion time (ECT). We reviewed, evaluated and compared the proposed algorithms against one of the well-known genetic algorithms available in the literature, which has been proposed for the task scheduling problem on heterogeneous computing systems. Moreover, this comparison has been extended to an existing greedy search method, and to an exact formulation based on basic integer linear programming. The proposed genetic algorithms show a good performance dominating the evaluated methods in terms of problems' sizes and time complexity for large benchmark sets of instances. We also extended three existing mathematical formulations to derive an exact solution for this problem. These mathematical formulations were validated and compared to each other by extensive computational experiments. Moreover, we proposed an integer linear programming formulations for solving unrelated parallel machine scheduling with precedence/disjunctive constraints, this model based on the intervaland m-clique free graphs with an exponential number of constraints. We developed a Branch-and-Cut algorithm, where the separation problems are based on graph algorithms. [...]
Almoustafa, Samira. „Distance-constrained vehicle routing problem : exact and approximate solution (mathematical programming)“. Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7640.
Der volle Inhalt der QuelleBücher zum Thema "Exact and approximate inferences"
Reinhard, Klette, Hrsg. Euclidean shortest paths: Exact or approximate algorithms. London: Springer-Verlag, 2011.
Den vollen Inhalt der Quelle findenQueueing networks with blocking: Exact and approximate solutions. New York: Oxford University Press, 1994.
Den vollen Inhalt der Quelle findenChang, Yin-Wen. Exact and Approximate Methods for Machine Translation Decoding. [New York, N.Y.?]: [publisher not identified], 2015.
Den vollen Inhalt der Quelle findenIvan, Markovsky, Hrsg. Exact and approximate modeling of linear systems: A behavioral approach. Philadelphia: Society for Industrial and Applied Mathematics, 2006.
Den vollen Inhalt der Quelle findenKiss, Istvan Z. Mathematics of Epidemics on Networks: From Exact to Approximate Models. Cham: Springer International Publishing, 2017.
Den vollen Inhalt der Quelle findenChen, Hsing-Ta. Delving Into Dissipative Quantum Dynamics: From Approximate to Numerically Exact Approaches. [New York, N.Y.?]: [publisher not identified], 2016.
Den vollen Inhalt der Quelle findenGlowinski, R. Exact and approximate controllability for distributed parameter systems: A numerical approach. New York: Cambridge University Press, 2008.
Den vollen Inhalt der Quelle findenHartley, T. T. Exact and approximate solutions to the oblique shock equations for real-time applications. [Akron, Ohio: University of Akron, Electrical Engineering Dept., 1991.
Den vollen Inhalt der Quelle findenBurstein, Joseph. Exact numerical solutions of nonlinear differential equations, short algorithms: After three centuries of approximate methods. Boston: Metrics Press, 2002.
Den vollen Inhalt der Quelle findenKlette, Reinhard, und Fajie Li. Euclidean Shortest Paths: Exact or Approximate Algorithms. Springer London, Limited, 2014.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Exact and approximate inferences"
Kwatra, Saloni, und Vicenç Torra. „Empirical Evaluation of Synthetic Data Created by Generative Models via Attribute Inference Attack“. In IFIP Advances in Information and Communication Technology, 282–91. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57978-3_18.
Der volle Inhalt der QuelleAzzolini, Damiano, Elena Bellodi und Fabrizio Riguzzi. „Approximate Inference in Probabilistic Answer Set Programming for Statistical Probabilities“. In AIxIA 2022 – Advances in Artificial Intelligence, 33–46. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27181-6_3.
Der volle Inhalt der QuelleMuhamed, Aashiq, Sriram Srinivasan, Choon-Hui Teo, Qingjun Cui, Belinda Zeng, Trishul Chilimbi und S. V. N. Vishwanathan. „Web-Scale Semantic Product Search with Large Language Models“. In Advances in Knowledge Discovery and Data Mining, 73–85. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33380-4_6.
Der volle Inhalt der QuelleTsurkov, Vladimir. „Exact and Approximate Aggregation“. In Large-scale Optimization — Problems and Methods, 1–76. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-3243-6_1.
Der volle Inhalt der QuelleCygan, Marek, und Marcin Pilipczuk. „Exact and Approximate Bandwidth“. In Automata, Languages and Programming, 304–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02927-1_26.
Der volle Inhalt der QuelleGodbole, Anant P., Sanjay Khunger und Esther Ososanya. „Exact and Approximate Hypercube Reliabilities“. In Runs and Patterns in Probability, 163–72. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4613-3635-8_10.
Der volle Inhalt der QuelleHelgaker, Trygve, Poul Jørgensen und Jeppe Olsen. „Exact and Approximate Wave Functions“. In Molecular Electronic-Structure Theory, 107–41. Chichester, UK: John Wiley & Sons, Ltd, 2014. http://dx.doi.org/10.1002/9781119019572.ch4.
Der volle Inhalt der QuelleElad, Michael. „From Exact to Approximate Solutions“. In Sparse and Redundant Representations, 79–109. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-7011-4_5.
Der volle Inhalt der QuelleAlon, Noga, und Shai Gutner. „Balanced Hashing, Color Coding and Approximate Counting“. In Parameterized and Exact Computation, 1–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-11269-0_1.
Der volle Inhalt der QuelleDodson, M. M. „Abstract Exact and Approximate Sampling Theorems“. In New Perspectives on Approximation and Sampling Theory, 1–21. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08801-3_1.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Exact and approximate inferences"
Marinescu, Radu, Haifeng Qian, Alexander Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao und Ryan Riegel. „Approximate Inference in Logical Credal Networks“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/632.
Der volle Inhalt der Quellevan Bremen, Timothy, und Ondrej Kuzelka. „Approximate Weighted First-Order Model Counting: Exploiting Fast Approximate Model Counters and Symmetry“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/587.
Der volle Inhalt der QuelleLee, K. David, Eric Wiesenfeld und Andrew Gelfand. „Statistical comparison of a hybrid approach with approximate and exact inference models for Fusion 2+“. In Defense and Security Symposium, herausgegeben von Ivan Kadar. SPIE, 2007. http://dx.doi.org/10.1117/12.717398.
Der volle Inhalt der QuelleLee, Nian-Ze, Yen-Shi Wang und Jie-Hong R. Jiang. „Solving Stochastic Boolean Satisfiability under Random-Exist Quantification“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/96.
Der volle Inhalt der QuelleTian, Zheng, Ying Wen, Zhichen Gong, Faiz Punakkath, Shihao Zou und Jun Wang. „A Regularized Opponent Model with Maximum Entropy Objective“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/85.
Der volle Inhalt der QuelleAllphin, Devin, und Joshua Hamel. „A Parallel Offline CFD and Closed-Form Approximation Strategy for Computationally Efficient Analysis of Complex Fluid Flows“. In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-38691.
Der volle Inhalt der QuelleJha, Chandan Kumar, und Joycee Mekie. „SEDA - Single Exact Dual Approximate Adders for Approximate Processors“. In DAC '19: The 56th Annual Design Automation Conference 2019. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3316781.3322475.
Der volle Inhalt der QuelleYeredor, Arie. „On hybrid exact-approximate joint diagonalization“. In 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, 2009. http://dx.doi.org/10.1109/camsap.2009.5413271.
Der volle Inhalt der QuelleHuber, Mark. „Exact sampling and approximate counting techniques“. In the thirtieth annual ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/276698.276709.
Der volle Inhalt der QuellePiper, John E. „Exact and approximate time-shift operators“. In SPIE Defense, Security, and Sensing, herausgegeben von Edmund G. Zelnio und Frederick D. Garber. SPIE, 2009. http://dx.doi.org/10.1117/12.818196.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Exact and approximate inferences"
Mobley, Curtis D. Ecosystem Predictions with Approximate vs. Exact Light Fields. Fort Belvoir, VA: Defense Technical Information Center, März 2009. http://dx.doi.org/10.21236/ada495652.
Der volle Inhalt der QuelleMobley, Curtis D. Ecosystem Predictions with Approximate vs. Exact Light Fields. Fort Belvoir, VA: Defense Technical Information Center, Januar 2008. http://dx.doi.org/10.21236/ada519107.
Der volle Inhalt der QuelleBoland, Matthew R. Examination of the Use of Exact Versus Approximate Phase Weights on the Performance of a Synthetic Aperture Sonar System. Fort Belvoir, VA: Defense Technical Information Center, März 2003. http://dx.doi.org/10.21236/ada414590.
Der volle Inhalt der QuelleZarrieß, Benjamin, und Anni-Yasmin Turhan. Most Specific Generalizations w.r.t. General EL-TBoxes. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.196.
Der volle Inhalt der QuelleBaader, Franz, und Oliver Fernández Gil. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.229.
Der volle Inhalt der QuelleAllegheny woodrat and eastern small-footed bat inventory: White Rocks ? Cumberland Gap National Historical Park. National Park Service, 2024. http://dx.doi.org/10.36967/2302513.
Der volle Inhalt der Quelle