For Isabelle/HOL, the Isabelle Refinement Framework [24, 26, 27, 32] provides a powerful stepwise refinement tool chain, featuring a nondeterministic shallowly embedded programming language [32], a library of efficient collection data structures and generic algorithms [26, 27, 30], and convenience...
(b) to describe technical issues and problematic aspects related to current 3D city model formats that are known by developers but are not properly documented in the scientific literature; and (c) to foster an open discussion about the best data structures and algorithms to process 3D city ...
Faiss is a library for efficient similarity search and clustering of dense vectors. It contains algorithms that search in sets of vectors of any size, up to ones that possibly do not fit in RAM. It also contains supporting code for evaluation and parameter tuning. Faiss is written in C++ ...
Examines the domain decomposition algorithms for parallel numerical solution of parabolic equations. Use of implicit schemes to march with large time steps; Realization of parallelization by approximating interface values; Analysis of multistep second order explicit and one-step high-order schemes. 年份:...
More recently, message passing algorithms for optimal decycling in statistical physics further pushed the critical point toward its optimal value20,21. For susceptible-infected-recovered (SIR) model, the prob- lem of finding influential spreaders is also explored using the percolation theory in recent...
New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0. Syst Biol. 2010;59(3):307–21. Article CAS Google Scholar FigTree [http://tree.bio.ed.ac.uk/software/figtree/]. Wan Q, Zhang Q, Hamilton-Brehm S, Weiss K, Mustyakimov M, ...
Keywords: nanolight-emitting diodes (nanoLEDs); neuro- morphic nanophotonic computing; Purcell effect; quan- tum resonant tunneling (QRT); spiking neural networks; subwavelength devices. 1 Introduction Artificial intelligence (AI) systems using computing algorithms of deep learning neural networks (DNNs)...
However, the initialization can become a limiting factor, if we either reach memory limits in gather-scatter algorithms, or if we have to re-initialize communication relations due to dynamic changes in mutual data dependencies between coupled codes. Lindner [12,13] already removed several ...
This involves deriving important key properties of the Tukey g-and-h transformation and resulting family of spatial warped GP (Section 2 and Section 3); and using those results to develop new estimation algorithms for efficient spatial field reconstructions (Section 4). Our contributions may be ...
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, dynamic programming (DP), etc.) and...