We present a method for solving service allocation problems in which a set of services must be allocated to a set of agents so as to maximize a global utility. The method is completely distributed so it can scale to any number of services without degradation. We first formalize the service allocation problem and then present a simple hill-climbing, a global hillclimbing, and a bidding-protocol ...

The mammalian lung develops through branching morphogenesis. Two primary forms of branching, which occur in order, in the lung have been identified: tip bifurcation and side branching. However, the mechanisms of lung branching morphogenesis remain to be explored. In our previous study, a biological mechanism was presented for lung branching pattern formation through a branching model. Here, we ...

there is a need to analyze and map rainfall erosivity to assess soil erosion at the regional scale. the objectives of this study were to develop a regional model to estimate seasonal erosivity from seasonal rainfall data and to study temporal and spatial distribution of rainfall erosivity for the gorganrood drainage basin in the northeast of iran. six gauging stations with a high temporal reso...

We derive different local approximations along with estimates of the remainders for the total mass processes of two branching particle systems. To this end, we investigate the corresponding classes of integer-valued variables. One of them is comprised of Pólya-Aeppli distributions, while members of the other class are the convolutions of a zero-modified geometric law. We obtain the closed-form ...

Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice. For the binary case, it is based on defining a neighbourhood of the current incumbent solution by allowing only a few binary variables to flip their value, through the addition of a local branching constraint. The neighbourhood is...

Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a box-covering algorithm that is a modified version of the original algorithm introduced by Song [Nature (London) 433, 392 (2005)]; this algorithm enables easy implementation. Fractal networks are viewed as comprising a skeleton and sh...

We present an O(1.0919)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3, which improves the previously known algorithm of running time O(1.0977) by Bourgeois, Escoffier and Paschos [IWPEC 2008]. We also present an O(1.1923)-time algorithm to decide if a graph with degree bounded by 3 has a vertex cover of size k, which improves the previously k...

We extend the branching diffusion Monte Carlo method of Henry-Labordere e.a. [2019] to case parabolic PDEs with mixed local-nonlocal analytic nonlinearities. investigate representations classical solutions, and we provide sufficient conditions under which representation solves PDE in viscosity sense. Our theoretical setup directly leads a algorithm, whose applicability is showcased stylized hig...

the main purpose in this paper, to express strong algorithmic optimization in their ability to detect expression target of sar that use in aircraft, plane and satellites to observe the target on the ground. for this purpose,the sar technology and its applications are introduced. previous algorithms used in this field with poor diagnosis and appropriate speed is low, like means and fuzzy and pso...