نتایج جستجو برای: generate large candidate path sets
تعداد نتایج: 1546478 فیلتر نتایج به سال:
Parameterization of processes that occur on length scales too small to resolve on a computational grid is a major source of uncertainty in global climate models. This study investigates the relative importance of a number of parameters used in the Goddard Earth Observing System Model, version 5 (GEOS-5), atmospheric general circulation model, focusing on cloud, convection, and boundary layer pa...
The ability to predict drug activity from molecular structure is an important field of research both in academia and in the pharmaceutical industry. Raw 3D structure data is not in a form suitable for identifying properties using machine learning so it must be reconfigured into descriptor sets that continue to encapsulate important structural properties of the molecule. In this study, a large n...
This paper proposes an integrated network design model for a post-distribution cross-docking strategy, comprising multi product production facilities with shared production resources, capacitated cross docks with setup cost and customer zones with time windows constraints. The model is dynamic in terms of time-varying uncertain demands, whereas uncertainty is expressed with scenario approach an...
We propose a method of generating avoidance motions. We use a motion graph to generate continuous motions, including both avoidance and other kinds of motions. In the combat of real humans, trained fighters avoid an attack with minimal movement. To realize such avoidance motion, we developed criteria to find an appropriate path (series of edges) in the motion graph. The characters are expected ...
Links between heterogeneous data sets may be found by using a generalisation of keys in databases, called linkkeys, which apply across data sets. This paper considers the question of characterising such keys in terms of formal concept analysis. This question is natural because the space of candidate keys is an ordered structure obtained by reduction of the space of keys and that of data set par...
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
To study large-scale effects on the Internet various models have been introduced to generate Internet-like autonomous system (AS) topologies. The models for large-scale AS topologies have been focused on replicating structural graph properties. One of the most promising model is the Positive Feedback Model model (PFP). These models however lack the ability to generate routing path and realistic
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید