The treelike structures of many organs, including the mammary gland, are generated by branching morphogenesis, a reiterative process of branch initiation and invasion from a preexisting epithelium. Using a micropatterning approach to control the initial three-dimensional structure of mouse mammary epithelial tubules in culture, combined with an algorithm to quantify the extent of branching, we ...

We consider catalytic branching random walk (the reactant) where the state space is a countable Abelean group. The branching is critical binary and the local branching rate is given by a catalytic medium. Here the medium is itself an autonomous (ordinary) branching random walk (the catalyst) – maybe with a different motion law. For persistent catalyst (transient motion) the reactant shows the u...

In Pareto bi-objective integer optimization the optimal result corresponds to a set of nondominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a problem-independent branching rule exploiting available integer solutions, and cutting plane generation taking advantage of integer objective values. The developed algorithm is applied to the bi-objective team ori...

today, online social networks are very popular due to the possibility of creating relationships between people all over the world. these social networks with possibilities such as friend recommendation generally use local features derived from social graph structure. for friend recommendation, there are different algorithms with local and global approaches. in this paper, we proposed an algorit...

We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies.

The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents other theoretical limitations of the maxn algorithm, namely that tie-breaking strategies are crucial to maxn, and that zerowindow search is not possible in maxn game trees. We also present quantitative results derived fr...

The problem of determining if an r-CNF boolean formula F over n variables is satisifiable reduces to the problem of determining if F has a satisfying assignment with a Hamming distance of at most d from a fixed assignment α [DGH02]. This problem is also a very important subproblem in Schöning’s local search algorithm for r-SAT [Sch99]. While Schöning described a randomized algorithm solves this...

We extend Sandholm’s bidtree-based IDA* algorithm for combinatorial auction winner determination to deal with negotiation over tasks with precedence constraints. We evaluate its performance, and show that the order of items in the bidtree has a major impact on performance. Specifically, performance is enhanced if the items with the largest numbers of bids are at the top of the bidtree. This is ...

We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory. Specifically, we show that given a biased graph Ψ = (G,B), where B is a class of balanced cycles in G, the problem of finding a set X of at most k vertices in G whi...