Search Results - (( rate estimation clustering algorithm ) OR ( global distribution process algorithm ))*
Search alternatives:
- estimation clustering »
- distribution process »
- global distribution »
- process algorithm »
- rate estimation »
-
1
Balancing Exploitation And Exploration Search Behavior On Nature-Inspired Clustering Algorithms
Published 2018“…Unfortunately, these algorithms suffer with several drawbacks such as the tendency to be trapped or stagnate into local optima and slow convergence rates. …”
Get full text
Get full text
Thesis -
2
Semiparametric binary model for clustered survival data
Published 2014“…We investigated the effects of the strength of cluster correlation and censoring rates on properties of the parameters estimate. …”
Get full text
Get full text
Conference or Workshop Item -
3
Efficient tag grouping RFID anti-collision algorithm for internet of things applications based on improved k-means clustering
Published 2023“…In the initialization stage, the reader uses improved K-means clustering running concurrently with a tag counter algorithm to cluster tags into K groups using tags RN16 while the counter returns an accurate tag number estimate. …”
Get full text
Get full text
Article -
4
Clock Distribution Network Building Algorithm For Multiple Ips In System On A Chip
Published 2017“…In this project, an algorithm is proposed and developed to build the global CDN that is used to distribute the clocks to all partitions in the SoC using the channels available between partitions. …”
Get full text
Get full text
Thesis -
5
Machine learning for mapping and forecasting poverty in North Sumatera: a datadriven approach
Published 2024“…The poverty mapping showed a significant inertia value decline in the third and fourth clusters of the elbow graph. The third cluster (0.313) was superior to the fourth cluster (0.244) in the silhouette index. …”
Get full text
Get full text
Get full text
Article -
6
Static and self-scalable filter range selection algorithms for peer-to-peer networks
Published 2011“…The range will be adjusted and becomes narrower while ensuring the target keys are still within it as the process iterates until the keys have been found. The selfscalable selection algorithm uses dynamic range where the filter range is not preset and is determined by the algorithm itself based on the distribution and the values of the data in the global and local file. …”
Get full text
Get full text
Thesis -
7
Statistical fixed range multiple selection algorithm for peer-to-peer system
Published 2010“…A global file with n keys is distributed evenly among p peers in the peer-to-peer network. …”
Get full text
Get full text
Conference or Workshop Item -
8
A Robust Firearm Identification Algorithm of Forensic Ballistics Specimens
Published 2017“…The proposed algorithm comprises Laplacian sharpening filter, clustering-based threshold selection, unweighted least square estimator, and segment a square ROI from the noisy images. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
A non-blocking coordinated checkpointing algorithm for message-passing systems
Published 2015“…The processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
10
Static range multiple selection algorithm for peer-to-peer system
Published 2011“…A global file with n keys is distributed evenly among n peers in the peer-to-peer network. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Deriving global and local integrity rules for a distributed database
Published 2001“…Our technique referred to as the integrity test generation, derives global and local integrity rules has effectively reduced the cost of constraint checking in a distributed environment.…”
Get full text
Get full text
Get full text
Article -
12
Text independent speaker identification using gaussian mixture model
Published 2007“…For speaker model training, a fast re-estimation algorithm based on highest likelihood mixture clustering is introduced. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Distance vector-hop range-free location algorithm for wireless sensor network
Published 2015“…This has caused the tasks for each sensor node to be permanently fixed, thus causing the overall process of the localization algorithm to be complex. …”
Get full text
Get full text
Thesis -
14
-
15
Cost-effective scheduling analysis through discrete event simulation for distributed systems
Published 2015“…Large computing systems where globally distributed can be best characterized by their dynamic nature particularly in terms of resource provisioning and scheduling. …”
Get full text
Get full text
Get full text
Book Section -
16
Big data storage for the modeling of historical time series solar irradiations
Published 2018“…© 2018, IGI Global.…”
Get full text
Get full text
Book -
17
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
18
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job.Resources with high pheromone value are selected to process the submitted jobs. Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
Get full text
Get full text
Get full text
Monograph -
19
Channel Modeling and Direction-of-Arrival Estimation in Mobile Multiple-Antenna Communication Systems
Published 2005“…One problem when modeling frequency selective fading is that each cluster has to be assigned spatial parameters. Since the joint spatial and temporal characteristics are unknown, non-parametric channel estimation approaches are required in this case in order to estimate the channel parameter, which is the subject of the second part. …”
Get full text
Get full text
Thesis -
20
