Search Results - (( developing executive computing algorithm ) OR ( java application system algorithm ))*
Search alternatives:
- developing executive »
- executive computing »
- computing algorithm »
- java application »
- system 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
Network game (Literati) / Chung Mei Kuen
Published 2003“…The possible applications of multimedia-networked system are endless, as the demand to support interactive communication among groups of users has increased significantly. …”
Get full text
Get full text
Thesis -
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
Challenges of hidden data in the unused area two within executable files
Published 2009“…Results: The programs were coded in Java computer language and implemented on Pentium PC. The designed algorithms were intended to help in proposed system aim to hide and retract information (data file) with in unused area 2 of any execution file(exe.file). …”
Get full text
Get full text
Get full text
Article -
6
Network monopoly / Tan Kean Yeap
Published 2002“…The algorithm design and implementation method mustnot only be workable, but also highly efficient in terms of execution speed and respond time. …”
Get full text
Get full text
Thesis -
7
-
8
-
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
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
11
-
12
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 -
13
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 -
14
Real-time algorithmic music composition application.
Published 2022“…In addition, the system also utilises JavaFx and jFugue for its graphical user interface and music programming respectively. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
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
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
17
-
18
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
19
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 -
20
