Search Results - (( using web proposed algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…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 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. 3

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

    Published 2018
    “…In order to tackle above problem, a modified algorithm for Web page recommendation is proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    A new algorithm to measure relevance among Web pages by Sadi, M.S., Rahman, M.M. Hafizur, Horiguchi, Susumu

    Published 2006
    “…This paper proposes a new algorithm to measure relevance among Web pages (RWP) using a hybrid method of hyperlink analysis and content analysis. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    An improved framework for content and link-based web spam detection: a combined approach by Shahzad, Asim

    Published 2021
    “…The content-based web spam detection framework uses three proposed and two improved content-based algorithms for web spam detection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  8. 8

    Ant colony algorithm for web page classification by Moayed, Majid Javid, Sabery, A. Hamid, Khanteymoory, Alireza

    Published 2008
    “…Ant Miner II is the used algorithm. It also propose a simple text preprocessing technique to reduce the large numbers of attributes associated with web content mining, without dealing linguistic complications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A recommender system approach for classifying user navigation patterns using longest common subsequence algorithm. by Jalali, Mehrdad, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2009
    “…The approach is based on the using longest common subsequence algorithm to classify current user activities to predict user next movement. …”
    Get full text
    Get full text
    Article
  11. 11

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  14. 14
  15. 15

    Web application vulnerabilities detection model by Buja, Alya Geogiana, Abd. Jalil, Kamarularifin, Mohd Ali, Fakariah, Abdul Rahman, Teh Faradilla

    Published 2016
    “…The research will be carried out by using design string matching algorithm. The algorithm is used in order to match the defined criteria of each web vulnerability with the input information about web application. …”
    Get full text
    Get full text
    Research Reports
  16. 16

    A new ant based rule extraction algorithm for web classification by Ku-Mahamud, Ku Ruhana, Saian, Rizauddin

    Published 2011
    “…Using Classifier-based attribute subset selection will reduce more attributes, but sacrifice the performance of the classifier.A hybrid ant colony optimization with simulated annealing algorithm to discover rules from data is proposed.The simulated annealing technique will minimize the problem of low quality discovered rule by an ant in a colony.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The best rule for a colony will then be chosen and later the best rule among the colonies will be included in the rule set.The rule set is arranged in decreasing order of generation.Thirteen data sets which consist of discrete and continuous data were used to evaluate the performance of the proposed algorithm in terms of accuracy, number of rules and number of terms in the rules.Experimental results obtained from the proposed algorithm are comparable to the results of the Ant-Miner algorithm in terms of rule accuracy but are better in terms of rule simplicity.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Intelligent cooperative web caching policies for media objects based on J48 decision tree and naïve Bayes supervised machine learning algorithms in structured peer-to-peer systems by Ibrahim, Hamidah, Mohammed, Waheed Yasin, Udzir, Nur Izura, Abdul Hamid, Nor Asilah Wati

    Published 2016
    “…The proposed approaches take the advantages of structured peer-to-peer systems where the contents of peers’ caches are shared using Distributed Hash Table (DHT) in order to enhance the performance of the web caching policy. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Web cluster load balancing via genetic-fuzzy based algorithm by Chin, Wen Cheong, Lim, Amy Hui Lan

    Published 2007
    “…In this genetic-fuzzy based Generalized Dimension Exchange (GDE) method is proposed to uniformly distribute the unprecedented Web cluster workload. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining by Jalali, Mehrdad

    Published 2009
    “…In this phase, an undirected graph based on the Web pages as graph vertices and degree of connectivity between web pages as weight of the graph is created by proposing new formula for weight of the each edge in the graph. …”
    Get full text
    Get full text
    Thesis