Search Results - (( developing executive computing algorithm ) OR ( java applications using algorithm ))
Search alternatives:
- developing executive »
- executive computing »
- computing algorithm »
- applications using »
- java applications »
- using algorithm »
-
1
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text
Monograph -
2
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 -
3
Automated time series forecasting
Published 2011“…While quantitative technique is based on statistical concepts and requires large amount of data in order to formulate the mathematical models.This technique can be classified into projective and causal technique.The projective technique (or univariate modelling) just involve one variable while the causal technique (or econometric modelling) suitable for multi-variables.Since forecasting involves uncertainty, several methods need to be executed on one set of time series data in order to produce accurate forecast.Hence, usually in practice forecaster need to use several softwares to obtain the forecast values.If this practice can be transformed into algorithm (well-defined rules for solving a problem) and then the algorithm can be transformed into a computer program, less time will be needed to compute the forecast values where in business world time is money.In this study, we focused on algorithm development for univariate forecasting techniques only and will expand towards econometric modelling in the future.Two set of simulated data (yearly and non-yearly) and several univariate forecasting techniques (i.e. …”
Get full text
Get full text
Get full text
Monograph -
4
Resource management in grid computing using ant colony optimization
Published 2011“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.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. …”
Get full text
Get full text
Get full text
Get full text
Monograph -
5
Network game (Literati) / Chung Mei Kuen
Published 2003“…Therefore, efficient and robust servers that process separate client connections in separate threads are needed. Java applet is a well-known and widely used example of mobile code (a variation on the traditional client-server model). …”
Get full text
Get full text
Thesis -
6
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Network monopoly / Tan Kean Yeap
Published 2002“…The number of computers in use worldwide, according to the International Data Corporation, is in excss of 100 milion. …”
Get full text
Get full text
Thesis -
8
The implications for ahybrid detection technique against malicious sqlattacks on web applications
Published 2025“…The methodology is based on JavaScript and PHP languages for developing a new technique called DetectCombined capable of filtering queries using parameterized queries to protect against SQL injection which is a safe method. …”
Get full text
Get full text
Get full text
Article -
9
An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing
Published 2020“…The proposed algorithm was developed in a simulated grid environment called GridSim and evaluated against other fault tolerance algorithms such as trust-based ACO, fault tolerance ACO, ACO without fault tolerance and ACO with fault tolerance in terms of total execution time, average latency, average makespan, throughput, execution success rate and load balancing. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
RISC-V instruction set extension on blockchain application
Published 2024“…In this project, some instructions were proposed to execute the cryptographic algorithm in shorter clock cycles and shorter execution time. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network
Published 2007“…In the first, the Improved Zero algorithm is proposed to solve the problem and secondly, the Bitwise Improved Zero algorithm is developed. …”
Get full text
Get full text
Thesis -
12
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
13
-
14
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
15
Pengesan lalu lintas dengan kaedah pemerosesan imej
Published 2001“…This study was conducted to develop efficient traffic detector using image-processing with a personal compute I: Traffic images were captured using ordinary analogue video camera and digitised using a video blastel: Four algorithms were developed i. e. algorithm for traffic counting, algorithm for vehicle classification. algorithm to determine the speed of the counted vehicles and algorithm for incident detection. …”
Get full text
Get full text
Article -
16
Greedyzero-based scheduling algorithm to route in optical low stage interconnection networks
Published 2012“…This algorithm has been developed to achieve performance goals in terms of 50% reduction in the number of passes.…”
Get full text
Get full text
Thesis -
17
Parallel block methods for solving higher order ordinary differential equations directly
Published 1999“…These methods approximate numerical solution at one point at a time and therefore do not fully exploit the capability of parallel computers. Hence, the development of parallel algorithms to suit these machines becomes essential. …”
Get full text
Get full text
Thesis -
18
The visualization of power density and temperature distribution of electronic system using elliptic PDE solver
Published 2008“…Numerical analysis is done in terms of execution time, number of iterations and computational complexity of the algorithm being used. …”
Get full text
Get full text
Article -
19
A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment
Published 2011“…Conclusion: Extensive performance analysis of GUS simulator can be deployed using the developed simulator with low computational overhead. …”
Get full text
Get full text
Get full text
Article -
20
The division free parallel algorithm for finding determinant
Published 2013“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text
Article
