ArvandHerd is a sequential satisficing planner that uses a portfolio consisting of LAMA and Arvand. This planner won the multi-core track of the 2011 International Planning Competition. In this paper, we describe the various components of ArvandHerd, the updates made for the 2014 competition, and the modifications that allow ArvandHerd to compete in the single-core sequential satisficing tracks.

the number of constructed dams has been largely increased due to high demands of water supplies, and earth dams are the most common types since they are more compatible to the environment. nevertheless, the stability of these important structures during earthquakes has to be carefully evaluated and guaranteed. in the past, earth dams usually designed with pure clay core, but in recent decades t...

The number of constructed dams has been largely increased due to high demands of water supplies, and earth dams are the most common types since they are more compatible to the environment. Nevertheless, the stability of these important structures during earthquakes has to be carefully evaluated and guaranteed. In the past, earth dams usually designed with pure clay core, but in recent decades t...

Objectives: The aim of this study was to compare the microtensile bond strengths (µ TBS) of three core materials with one lithium disilicate reinforced ceramic using two resin cements. Methods: Three core materials (Nulite F® (Biodental Technologies), Filtek Z250® (3M-ESPE), Prettau-Anterior® (Zirkonzhan, Germany)) were prepared as blocks (10×10×4 mm3) according...

introduction: in cases of severe hard tissue loss, 2 mm circumferential ferrule is difficult to achieve. so in these cases we should use different ferrule designs. this in vitro study investigated the effect of different ferrule designs on the fracture resistance of teeth restored with bonded post and cores. materials and methods: forty freshly-extracted central incisors were endodontically tre...

in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...