although, grapevines do not have a high chilling requirement, its fulfillment is critical for normal development of the vines. in tropical and subtropical regions such as farrashband, in the south of iran, there is no adequate winter chilling to release bud dormancy in grapevines. so it is necessary to consider the effect of chemical dormancy–breaking agents on bud dormancy. in the present rese...

During Multi-Agent Path Finding (MAPF) problems, agentscan be delayed by unexpected events. To address suchsituations recent work describes k-Robust Conflict-BasedSearch (k-CBS): an algorithm that produces coordinated andcollision-free plan is robust for up tokdelays. In thiswork we introducing a variety of pairwise symmetry break-ing constraints, specific tok-robust planning, can effi-ciently ...

Real-time agent-centered heuristic search is a well-studied problem where an agent that can only reason locally about the world must travel to a goal location using bounded computation and memory at each step. Many algorithms have been proposed for this problem, and theoretical results have also been derived for the worst-case performance. Assuming sufficiently poor tie-breaking, among other co...

We explore the macro-financial consequences of disruption a supply chain in an agent based framework characterized by two networks, credit network connecting banks and firms production upstream down-stream firms. consider scenarios. In first one, because lockdown all are forced to cut production. This generates sizable down-turn during due indirect effects shock (network financial accelerator)....

We have recently produced EMS-induced knock-out mutations at the Gc2 locus that were derived from Ae. sharonensis. Our data suggest that the Gc2 mutant is a knock-out of the gene encoding for the breaking agent. For analyzing the interactions of the Gc2 mutants with other Gc genes from different Aegilops species, we have crossed stocks with functional and mutant Gc2 genes with stocks having Gc ...

We examine the application of spectral clustering for breaking up the behaviour of a multi-agent system in space and time into smaller, independent elements. We extend the clustering into the temporal domain and propose a novel similarity measure, which is shown to possess desirable temporal properties when clustering multi-agent behaviour. We also propose a technique to add knowledge about eve...