نتایج جستجو برای: branching

تعداد نتایج: 27605  

Journal: :ALEA-Latin American Journal of Probability and Mathematical Statistics 2023

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور مرکز - دانشکده شیمی 1391

dendrimer synthesis strategies now provide virtual control of macromolecular nanostructures as a function of size and surface/interior functionality. these strategies involve the covalent assembly of hierarchical components reactive monomers , branch cells or dendron’s around atomic or molecular cores according to divergent/convergent dendrite branching principles.combinon of two or more dendri...

Journal: :Development 2011
Alon Lazarus Pierre Marie Del-Moral Ohad Ilovich Eyal Mishani David Warburton Eli Keshet

Blood vessels have been shown to play perfusion-independent roles in organogenesis. Here, we examined whether blood vessels determine branching stereotypy of the mouse lung airways in which coordinated branching of epithelial and vascular tubes culminates in their co-alignment. Using different ablative strategies to eliminate the lung vasculature, both in vivo and in lung explants, we show that...

A. asadi

In this research the exclusive decay of                         is calculated by QCD factorization (QCDF) method and final state interaction (FSI). First, the  decay is calculated via QCDF method. The result that is found by using the QCDF method is less than the experimental result. So FSI is considered to solve the decay. For this decay, via the exchange of mesons are chosen for the intermedi...

Journal: :CoRR 2010
Thanasis Balafoutis Anastasia Paparrizou Kostas Stergiou

The search strategy of a CP solver is determined by the variable and value ordering heuristics it employs and by the branching scheme it follows. Although the effects of variable and value ordering heuristics on search effort have been widely studied, the effects of different branching schemes have received less attention. In this paper we study this effect through an experimental evaluation th...

2000
Petr Savický Detlef Sieling

Restricted branching programs are considered in complexity theory in order to study the space complexity of sequential computations and in applications as a data structure for Boolean functions. In this paper (⊕, k)-branching programs and (∨, k)-branching programs are considered, i.e., branching programs starting with a ⊕(or ∨-)node with a fan-out of k whose successors are k read-once branching...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید