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

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

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...

Journal: :Brazilian Journal of Probability and Statistics 2022

We provide a generalization of Theorem 1 in Bartkiewicz et al. (2011) the sense that we give sufficient conditions for weak convergence finite dimensional distributions partial sum processes strongly stationary sequence to corresponding non-Gaussian stable process instead sums themselves distribution. As an application, describe asymptotic behaviour aggregation independent copies subcritical Ga...

2010
Alejandro Arbelaez Mikael Zayenz Lagerkvist Carl Christian Rolf Krzysztof Kuchcinski Thanasis Balafoutis Kostas Stergiou Anastasia Paparrizou Julien Vion Sylvain Piechowiak

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...

2004
Vincent Park

Many real life problems can be formulated as constraint satisfaction problems (CSPs). Backtracking search algorithms are usually employed to solve CSPs and in backtracking search the choice of branching strategies can be critical since they specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of...

Journal: :Plant physiology 2017
Bolaji Babajide Salam Siva Kumar Malka Xiaobiao Zhu Huiling Gong Carmit Ziv Paula Teper-Bamnolker Naomi Ori Jiming Jiang Dani Eshel

The potato (Solanum tuberosum) tuber is a swollen stem. Sprouts growing from the tuber nodes represent loss of apical dominance and branching. Long cold storage induces loss of tuber apical dominance and results in secondary branching. Here, we show that a similar branching pattern can be induced by short heat treatment of the tubers. Detached sprouts were induced to branch by the heat treatmen...

2010
Thanasis Balafoutis Kostas Stergiou

The two standard branching schemes for CSPs are d-way and 2-way branching. Although it has been shown that in theory the latter can be exponentially more effective than the former, there is a lack of empirical evidence showing such differences. To investigate this, we initially make an experimental comparison of the two branching schemes over a wide range of benchmarks. Experimental results ver...

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

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