State-of-the-art solvers for Constraint Satisfaction Problems (CSP), Mixed Integer Programs (MIP), and satisfiability problems (SAT) are usually based on a branch-and-bound algorithm. The question how to split a problem into subproblems (branching) is in the core of any branch-and-bound algorithm. Branching on individual variables is very common in CSP, MIP, and SAT. The rules, however, which v...

In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs (MIPs) to optimality. These are obtained from the master problem MIP by limiting the number of variab...

Net unfoldings are a well-known partial order semantics for Petri nets. Here we show that they are well suited to act as models for branching-time logics interpreted on local states. Such local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Local logics often allow for more eecient veriication proc...

Net unfoldings are a well-known partial order semantics for Petri nets. Here we show that they are well suited to act as models for branching-time logics interpreted on local states. Such local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Local logics often allow for more eecient veriication proc...

Computer Scrabble programs have achieved a level of performance that exceeds that of the strongest human players. MAVEN was the first program to demonstrate this against human opposition. Scrabble is a game of imperfect information with a large branching factor. The techniques successfully applied in two-player games such as chess do not work here. MAVEN combines a selective move generator, sim...

We study a spatial branching model, where the underlying motion is d-dimensional (d ≥ 1) Brownian motion and the branching rate is affected by a random collection of reproduction suppressing sets dubbed mild obstacles. We show that the quenched local growth rate is given by the branching rate in the ‘free’ region. We obtain the asymptotics (in probability) of the quenched global growth rates fo...

we present a case of allergic fungal sinusitis (afb) in a 20-year old man with few months' history of bilateral nasal obstruction and discharge with unilateral proptosis that underwent maxillary antrostomy due to the mass in paranasal sinuses. histological examination of tissue showed branching fungal hyphae interspersed with allergic mucin without fungal invasion to soft tissue. the patient re...

The local behavior of mappings with the inverse Poletsky inequality between metric spaces is studied. case where one satisfies condition weak sphericalization, similar to Riemannian sphere (extended Euclidean space), and locally linearly connected under a mapping considered. It proved that equicontinuity corresponding families two domains, which domain weakly flat boundary, another fixed compac...