نتایج جستجو برای: generate large candidate path sets
تعداد نتایج: 1546478 فیلتر نتایج به سال:
multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...
Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...
Genome-wide experimental methods to identify disease genes, such as linkage analysis and association studies, generate increasingly large candidate gene sets for which comprehensive empirical analysis is impractical. Computational methods employ data from a variety of sources to identify the most likely candidate disease genes from these gene sets. Here, we review seven independent computationa...
Genome-wide experimental methods to identify disease genes, such as linkage analysis and association studies, generate increasingly large candidate gene sets for which comprehensive empirical analysis is impractical. Computational methods employ data from a variety of sources to identify the most likely candidate disease genes from these gene sets. Here, we review seven independent computationa...
A two-staged traffic control scheme, in which sets of candidate paths are prepared off-line prior to overall motion planning process, has been widely adopted for motion planning of mobile robots, but relatively little attention has been given to the application of the two-staged scheme to multiple automated guided vehicle systems (MAGVS’s). In this paper, a systematic two-staged traffic control...
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
We describe DAGGER, an ab initio gene recognition program which combines the output of high dimensional signal sensors in an intuitive gene model based on directed acyclic graphs. In the first stage, candidate start, donor, acceptor, and stop sites are scored using the SNoW learning architecture. These sites are then used to generate a directed acyclic graph in which each source-sink path repre...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید