Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Modes Of Computation (F.1.2)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 137 Reviews about "Modes Of Computation (F.1.2)": Date Reviewed   Conditioning in probabilistic programming Olmedo F., Gretz F., Jansen N., Kaminski B., Katoen J., Mciver A. ACM Transactions on Programming Languages and Systems 40(1): 1-50, 2018.  Type: Article Machine learning, possibly contrary to popular belief, is not just about endless variations of neural networks. There is also a thriving subculture of probabilistic programming based on Bayesian principles. A large advantage of the lat... Jun 13 2018   Discrete probability models and methods: probability on graphs and trees, Markov chains and random fields, entropy and coding Brémaud P., Springer International Publishing, New York, NY, 2017. 559 pp.  Type: Book (978-3-319434-75-9) Due to advances in both theory and practice, there has been a recent explosion in courses on network science and data science. These demand a solid background in probabilistic methods.... Feb 21 2018   An introduction to online computation: determinism, randomization, advice Komm D., Springer International Publishing, New York, NY, 2016. 349 pp.  Type: Book (978-3-319427-47-8) This text is an important contribution to the field of online algorithms. In a traditional (offline) algorithm all of the data is present before the algorithm executes. While for an online algorithm the data is presented in a piecewise... Oct 3 2017   A survey on thread-level speculation techniques Estebanez A., Llanos D., Gonzalez-Escribano A. ACM Computing Surveys 49(2): 1-39, 2016.  Type: Article The technique called thread-level speculation (TLS) seeks to allow sequential code to be executed in parallel without prior analysis of compile-time dependence. This noteworthy survey paper includes the technique, a taxonomy of TLS app... Sep 2 2016   Semantics of probabilistic processes: an operational approach Deng Y., Springer Publishing Company, Incorporated, New York, NY, 2015. 249 pp.  Type: Book (978-3-662451-97-7) This is a good resource for understanding issues related to the semantic foundations of concurrent systems. The author especially examines bisimulation semantics and testing semantics.... Oct 20 2015   The BonaFide C analyzer: automatic loop-level characterization and coverage measurement Aldea S., Llanos D., Gonzalez-Escribano A. The Journal of Supercomputing 68(3): 1378-1401, 2014.  Type: Article Loops in a software application are a crucial construct that heavily drives resource consumption, both in time and memory. For example, an improper loop boundary may have severe ripple effects, resulting in resource consumption anomali... Jul 13 2015   Parallel actor monitors: disentangling task-level parallelism from data partitioning in the actor model Scholliers C., Tanter E., De Meuter W. Science of Computer Programming 8052-64, 2014.  Type: Article Scholliers et al. have designed and implemented a mechanism that allows message control within an actor to be parallelized. For example, in a dining philosophers example, the philosopher requests two forks; the order in which the forks... Apr 4 2014   Epistemic strategies and games on concurrent processes Chatzikokolakis K., Knight S., Palamidessi C., Panangaden P. ACM Transactions on Computational Logic 13(4): 1-35, 2012.  Type: Article Among the early process algebras, Hoare’s communicating sequential processes (CSP) [1] had an explicit syntax of process names, which could be thought of as “agents” that executed the processes. The commun... Apr 1 2013   Online execution time prediction for computationally intensive applications with periodic progress updates Chtepen M., Claeys F., Dhoedt B., De Turck F., Fostier J., Demeester P., Vanrolleghem P. The Journal of Supercomputing 62(2): 768-786, 2012.  Type: Article Grid computing is a recent technology that enables large-scale scientific computations. Efficient use of the vast number of distributed resources found in such infrastructures remains an important research issue. The task, typically ha... Mar 1 2013   A primal-dual randomized algorithm for weighted paging Bansal N., Buchbinder N., Naor J. Journal of the ACM 59(4): 1-24, 2012.  Type: Article Paging is a memory management technique where memory is divided into chunks of constant size called pages. A two-level memory system consists of a small fast memory (the cache) that can hold k pages and a large slow ... Feb 1 2013       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy