نتایج جستجو برای: constrained policy graph cpg
تعداد نتایج: 542087 فیلتر نتایج به سال:
طبیعت همواره نمایانگر بهترین شیوه های حرکت برای موجودات است. مطالعات فیزیولوژیکی اعصاب بدن موجودات زنده نشان داده است که حرکات پایه ای و تکراری بدن با شبکه های عصبی، تحت عنوان ایجادکننده الگوی مرکزی (cpg) ایجاد می شود. با توجه به شباهت های موجود مابین رباتیک و بیولوژی و همچنین فراگیر شدن استفاده از مطالعات زیستی در حوزه رباتیک، در این پژوهش از cpg به عنوان رهیافتی زیستی جهت حرکت ربات استفاده شد...
BACKGROUND Conflict of interest (COI) of clinical practice guideline (CPG) sponsors and authors is an important potential source of bias in CPG development. The objectives of this study were to describe the COI policies for organizations currently producing a significant number of CPGs, and to determine if these policies meet 2011 Institute of Medicine (IOM) standards. METHODOLOGY/PRINCIPAL F...
We consider the NP-hard Stochastic Orienteering Problem, where goal is to navigate between start and end vertices in a graph, maximizing sum of rewards for visited while obeying travel budget over edges with stochastic cost within given probability failure. Previously, we solved this by finding an initial path using deterministic orienteering solver transformed it into policy Constrained Markov...
Background & Aim: and achieving safe prophylactic and therapeutic procedures is the main aim of the investigators. CpGoligodeoxynucleotides (CpG ODN) which modulate the immune responses and change the cytokine patterns by severalmechanisms are among these procedures.Worldwide increasing number of allergic disorders is one of the most important health challenges,Material and Method: Chenopodium ...
Many engineering disciplines require visualisation of networks. Constrained graph layout is a powerful new approach to network layout that allows the user to impose a wide variety application-specific placement constraints—such as downwards pointing directed edges, alignment of nodes, cluster containment and non-overlapping nodes and clusters—on the layout. We have recently developed an efficie...
Many state-of-the-art Deep Neural Networks (DNNs) have substantial memory requirements. Limited device becomes a bottleneck when training those models. We propose ParDNN, an automatic, generic, and non-intrusive partitioning strategy for DNNs that are represented as computational graphs. ParDNN decides placement of DNN’s underlying graph operations across multiple devices so the devices’ constr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید