نتایج جستجو برای: three heuristics named cluster
تعداد نتایج: 1529023 فیلتر نتایج به سال:
Dong Min Kim (Dane) Writing 340 Illumin Article June-12-2013 Abstract Building a house using 3-D printing technology is available to people in near future. Contour crafting is the method that can build a house quickly, safely, and economically. Since the robots and computers are the main part of the construction, human labor restriction that causes expensive and inefficient construction will be...
We introduce GenRev, a network-based software package developed to explore the functional relevance of genes generated as an intermediate result from numerous high-throughput technologies. GenRev searches for optimal intermediate nodes (genes) for the connection of input nodes via several algorithms, including the Klein-Ravi algorithm, the limited kWalks algorithm and a heuristic local search a...
It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by gro...
Uncovering underlying community structures in complex networks has received considerable attention because of its importance in understanding structural attributes and group characteristics of networks. The algorithmic identification of such structures is a significant challenge. Local expanding methods have proven to be efficient and effective in community detection, but most methods are sensi...
Jian Li A Thesis Submitted for the Degree of Doctor of Philosophy Brunel University II Ensemble Clustering via Heuristic Optimisation
This article presents a Bayesian method for model-based clustering of gene expression dynamics. The method represents gene-expression dynamics as autoregressive equations and uses an agglomerative procedure to search for the most probable set of clusters given the available data. The main contributions of this approach are the ability to take into account the dynamic nature of gene expression t...
In this paper an agglomerative heuristic cluster analysis framework is proposed for application to the part family and machine cell formation problems associated with Group Technology (GT). This framework addresses the notion of concurrently forming clusters of parts (families) and machines (cells) based upon natural between-part and between-machine relationships and the strength of association...
In this work, we present two heuristics to treat web pages from social networks for person name disambiguation in the Web. This problem consists in clustering the results provided by a search engine when the query is a person name according to the individual they refer to. Although these web pages could negatively affect when grouping the results, most of the systems in the state-of-the-art do ...
In the paper we present rst experimental results of a parallel implementation of simulated annealing-based heuristics. The heuristics are developed for the classical job shop scheduling problem that consists of l jobs where each job has to process exactly one task on each of the m machines. We utilize the disjunctive graph representation and the objective is to minimize the length of longest pa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید