We consider a geographic optimization problem in which we are given a region R, a probability density function f(·) defined on R, and a collection of n utility density functions ui(·) defined on R. Our objective is to divide R into n sub-regions Ri so as to “balance” the overall utilities on the regions, which are given by the integrals ̃ Ri f(x)ui(x) dA. Using a simple complementary slackness a...

Background and objective:Gastroesophageal reflux is one of the most common esophageal disordersat all age groups, especially in children, due to the transient slackness of sphincter of the lower esophagus, which results in impairment in the quality of life of the infant.Various studies have shown that proton pump inhibitors have a beneficial effect on the treatment of gastroesophageal reflux di...

We describe an O(nhmin{logU, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform...

In the conventional models of pipelined architectures, pipeline connicts are generally avoided through techniques like reservation tables. They are intended to describe the run time of instructions for which the delays between the execution stage and the fetch one is a constant depending only on the instruction. In fact actual superscalar processors don't comply this model since such delays are...

We consider the general (J,K)-secretary problem, where n totally ordered items arrive in a random order. An algorithm observes the relative merits of arriving items and is allowed to make J selections. The objective is to maximize the expected number of items selected among the K best items. Buchbinder, Jain and Singh proposed a finite linear program (LP) that completely characterizes the probl...

THE collection of manuscripts of the ancient medical writers that was made under the guidance of Hermann Diels was a model of scholarly co-operation and remains a basic tool of the investigator of the transmission of ancient science to the Middle Ages and to the Renaissance.' However, its failings are well known: there is confusion between works of similar title and subject, a slackness in noti...

In this paper, we consider the restless bandit problem, which is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. In its ultimate generality, the restless bandit problem is known to be PSPACE-Hard to approximate to any non-trivial factor, and little progress has been made on this problem despite its significance in modeling...