نتایج جستجو برای: three heuristics named cluster
تعداد نتایج: 1529023 فیلتر نتایج به سال:
tennessee williams (1911-1983), the modern american dramatist, had his own unique school of dramaturgy. the dramas which he depicted are populated by characters who are lonely, desperate, in anxiety, alienated and in one word lost. they face challenges which they may overcome or not, through the choices they make. all these moods and conditions are clearly seen and explained in the theory of ex...
Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ensembles have been examined in the literature, e.g., random feature selection, weak clusterers, random projections, etc. Typically, one heuristic is picked at a time to construct the ensemble. To increase diversity of the ense...
heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...
The development of highly accurate Named Entity Recognition (NER) systems can be beneficial to a wide range of Human Language Technology applications. In this paper we introduce three heuristics that exploit a variety of knowledge sources (the World Wide Web, Wikipedia and WordNet) and are capable of improving further a state-of-the-art multilingual and domain independent NER system. Moreover w...
We propose a resource-based Named Entity Classification (NEC) system, which combines named entity extraction with simple language-independent heuristics. Large lists (gazetteers) of named entities are automatically extracted making use of semi-structured information from the Wikipedia, namely infoboxes and category trees. Languageindependent heuristics are used to disambiguate and classify enti...
In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be fo...
in iran we already use laminate tubes only in cosmetics industry. laminate tube manufacturers via using the most modern technology of the world, faced with the laminate tube market being saturated in cosmetics industry for packaging the cosmetic creams and toothpaste. but considering the great food market and therefore laminate tube features such as beautiful packaging, ease of use for the fina...
Abstract Motivated by a routing problem faced banks to enhance their encashment services in the city of Perm, Russia, we solve versions traveling salesman (TSP) with clustering. To minimize risk theft, suppliers seek operate multiple vehicles and determine an efficient routing; and, single vehicle serves set locations that forms cluster. This need form independent clusters—served distinct vehic...
We present a partial-order probabilistic planning algorithm that adapts plan-graph based heuristics implemented in Repop. We describe our implemented planner, Reburidan, named after its predecessors Repop and Buridan. Reburidan uses plan-graph based heuristics to first generate a base plan. It then improves this plan using plan refinement heuristics based on the success probability of subgoals....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید