Optimization of Job Shop Scheduling Problem using Tabu Search Optimization Technique
The Job shop scheduling (JSS) problem consists of „n‟ jobs and „m
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
The Job shop scheduling (JSS) problem consists of „n‟ jobs and „m
confirmation experiments. The effects of welding process parameters on the macrohardness are presented as graphs
labels are represented in a hierarchical structure—either a tree or a directed acyclic graph (DAG) structure. A more difficult problem than conventional flat classification in this approach, given that
smart driving directions can mine from the historical GPS trajectories. A timedependent landmark graph is framed with the view of modeling the dynamic traffic pattern and also the intelligence ... distribution of travel…
Software testing is a process used to identify the correctness, completeness, and
video. In this paper we investigate this problem byintroducing two types of approaches.Error correcting graph matching algorithm for face name identification used to match face graph from video and name ... graph from…
Web-based communities have become important places for people to searching experts
framework includes three phases as: Alert generation phase, Consequence Tree construction phase and Dependency graph generation phase. In the alert generation, the security requirements are located in the administrator…
this paper, a vulnerability detection mechanism is proposed. It is built on attack graph-based models. The major components are a network intrusion detection agent and an attack graph generator ... comprises of two…
penetration rate for communication factors are used in the system. Dynamic Network Topology Graph (DNTG) is constructed and sampling technique is applied to handle the data delivery process.Traffic pattern based
The booming volume of data generated by contemporary business users and consumers
based on metric similarities, i.e., nonnegative, symmetric, and satisfying the triangle inequality measures using graph-based algorithm to replace this process a more recent approaches, like Affinity Propagation (AP)…
described in hierarchical structure or regions. In this project, we submit application graph laplacian energy as generic measure for segmentation. We capture in geometric outline of region in an image ... order of…
when user released some personal information in the network. Social network is represented as graph structure in which nodes and edges denotes user’s of network and relationship links with
encrypted. Sensitivity relationship between multiple data set is represented under Sensitive Intermediate data set Graph (SIG). Privacy-Preserving Cost Reducing Heuristic algorithm is used to control privacy leakage in…
high level of transformations. This paper also throws light on certain improvements in graph-based video sequence matching method which is used to overcome the level of noise, to detect
A database can contain several dimensions or attributes. Many Clustering methods are
social, and communication networks, often entail uncertainty, and thus, can be modelled as probabilistic graphs. In a clustering problem one has to partition a set of elements into homogeneous ... well-separated…
Faults are detected based on their classified types. To provide enhanced detection, an efficient graph mining technology is implemented and loc counts are individually features for localization of faults
penetration rate for communication factors are used in the system. Dynamic Network Topology Graph (DNTG) is constructed and sampling technique is applied to handle the data delivery process. The content
into two steps. In the first step, features are divided into clusters by using graph-theoretic clustering methods. In the second step, the most representative feature is selected from each
SIFT point set descriptors. To obtain the video sequence matching result propose a graph- based method. It is used to convert the video sequence into identifying the longest path
used to identify human faces across ages. This technique implements a weighted directed acyclic graph whose weight values represent similarities of the human faces taken into account. These weights
predefined threshold. In the second step selected relevant features are used to generate the graph, divide the features using graph theoretic method, and then clusters are formed by using Minimum
carried out with the combination of node details and connecting links in the social graph. Navie bayes classification algorithm is tuned to classify friendship links in a network. Local classifier
For authors and organisers
Find the right journal for your paper and submit your manuscript.