Deterministic Algorithms
Development of SUBSPACE-Based Hybrid Monte Carlo-Deterministic Algorithms for Reactor Physics Calculations.
... to deterministic transport methods that solve an explicit transport equation to obtain the average behavior of particles quantified ...Naturally, deterministic methods provide a full set of information for ...
167
Probabilistic linkage to enhance deterministic algorithms and reduce data linkage errors in hospital administrative data
... Linking records across the study period (1998–2015), the existing deterministic HESID algorithm has a missed match rate of 2.3% [95% Confidence Interval (CI) 2.2%, 2.4%] over- all, but Table 3 shows that this was ...
13
Probabilistic linking to enhance deterministic algorithms and reduce linkage errors in hospital administrative data
... Linking records across the study period (1998–2015), the existing deterministic HESID algorithm has a missed match rate of 2.3% [95% Confidence Interval (CI) 2.2%, 2.4%] over- all, but Table 3 shows that this was ...
13
A Survey on Randomized Algorithms and its Applications
... which of the possible runs of the algorithm will be chosen at random[2]. While an adversary may still be able to construct an input that is hard for one run, it is difficult to devise a single input that will defeat most ...
6
AN ENHANCED RULE APPROACH FOR NETWORK INTRUSION DETECTION USING EFFICIENT DATA ADAPTED DECISION TREE ALGORITHM
... The article is organized as follows. Section 2 focuses on descriptions of prior studies on the interconnect test generation. Section 3 is dedicated to the study of a hybrid optimization scheme for MCM test generation, ...
5
Cliptography: Clipping the Power of Kleptographic Attacks
... principle, algorithms in the specification of a cryptographic scheme or implementations provided by an adversary could be stateful; for simplicity, we focus on stateless implementations in the above ...For ...
33
Block-proximal methods with spatially adapted acceleration
... We only experiment with deterministic algorithms, as we do not expect small-scale randomi- sation to be beneficial. We also use the maximal κ ‘xxxM’ variants, as a more optimal κ would be very difficult to ...
35
Evaluating the Effectiveness of Mutation Operators on the Behavior of Genetic Algorithms Applied to Non-deterministic Polynomial Problems
... search algorithms based upon the principles of evolution observed in ...genetic algorithms can often find good solutions, near-optimal, in around 100 ...genetic algorithms is ...
6
Detection of deterministic and probabilistic convection initiation using Himawari-8 Advanced Himawari Imager data
... the deterministic RF model showed the highest overall accuracy ...of deterministic RF such as boot- strap aggregating and randomized node optimization which can reduce variance and overfitting when building ...
16
Examining QoS guarantees for real-time CBR services in broadband wireless access networks
... Scheduling algorithms play a key role in satisfying these QoS ...scheduling algorithms such as Packet-by-packet Generalized Processor Sharing (PGPS) [4], Self-Clocked Fair Queue- ing (SCFQ) [5], ...
6
Effective Routing Algorithm and Topology on Power Consumption in Networks on Chip
... Power dissipation is introduced as an important issue in NoCs because of advanced VLSI technology [4]. Researchers proposed many different approaches to decline energy consumption in NoCs [5]-[19]. A great deal of ...
8
Deterministic equation solving over finite fields
... my algorithms is completely elementary, but involves several levels of ...a deterministic adaptation of the Tonelli-Shanks root taking algorithm, which is presented in detail in Chapter ...
96
Lattice Sparsification and the Approximate Closest Vector Problem
... With the techniques in this paper, we note that the above rounding procedure can be made Las Vegas (i. e., no probability of error, randomized running time) by replacing the AKS Sieve with our new DPV-based solver ...
34
Cloud Technologies and Their Applications
... • First time using Deterministic Annealing for parallel MDS and GTM algorithms to visualize large and high-dimensional data • Processed 0.1 million PubChem data having 166 dimensions • P[r] ...
68
Deterministic Annealing
... You restate problem to consider from the start an arbitrary number of cluster centers at each center with pk the density of clusters at site k All these clusters at a given site have sam[r] ...
63
A general analytical model of adaptive wormhole routing in k-ary n-cubes
... Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern. Although, hypercube is a special case of k-ary n-cubes topology, ...
8
Deterministic Annealing
... – Probabilistic Latent Semantic Analysis with Deterministic Annealing DA-PLSA as alternative to Latent Dirichlet Allocation typical informational retrieval/global inference topic model h[r] ...
56
A. Deterministic Model
... The evolution of this value is random due to user behav- ior. If a router with 5 Gbps capacity had its buffer size com- pletely full for the whole duration of a 5-minute interval, then the evolution of the aggregate ...
5
The analysis and simulation of the spectral and statistical properties of road roughness for package performance testing
... Data representing a physical phenomenon, such as road profile data, can be broadly grouped into two basic categories, deterministic and non-deterministic. Deterministic data can be des[r] ...
139
SPIDAL and Deterministic Annealing
... algorithm ON2 for N points • We find visualization important to judge quality of clustering • As data typically not 2D or 3D, we use dimension reduction to project data so we can then vi[r] ...
30