We consider the problem of budget (or other resource) allocation in sequential decision problems involving a large number of concurrently running sub-processes, whose only interaction is through their gradual consumption of budget (or the resource in question). We use the case of an advertiser interacting with a large population of target customers as a primary motivation. We consider two compl...

This paper deals with multi-period project portfolio selection problem. In this problem, the available budget is invested on the best portfolio of projects in each period such that the net profit is maximized. We also consider more realistic assumptions to cover wider range of applications than those reported in previous studies. A novel mathematical model is presented to solve the problem, con...

Given a directed acyclic graph with timing constraints, the budget management problem is to assign to each vertex an incremental delay such that the total sum of these delays is maximized without violating given constraints. We propose the notion of slack sensitivity and budget gradient to demonstrate characteristics of budget management. We develop an optimal polynomial-time algorithm for the ...

Given a linear dynamical system, we consider the problem of selecting (at design-time) an optimal set of sensors (subject to certain budget constraints) to minimize the trace of the steady state error covariance matrix of the Kalman filter. Previous work has shown that this problem is NP-hard for certain classes of systems and sensor costs; in this paper, we show that the problem remains NP-har...

Workflow scheduling on utility Grids is a complex multi-objective optimization problem which tries to optimize several scheduling criteria such as execution time and cost. One common approach to the problem is to optimize only one criterion, while other criteria are constrained within fixed thresholds. In this paper, we propose a new scheduling algorithm called Budget Partial Critical Path (Bud...

In transportation planning and development, transport network design problem seeks to optimize specific objectives (e.g. total travel time) through choosing among a given set of projects while keeping consumption of resources (e.g. budget) within their limits. Due to the numerous cases of choosing projects, solving such a problem is very difficult and time-consuming. Based on particle swarm opt...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

Interactive verification is a new problem, which is closely related to active learning, but aims to query as many positive instances as possible within some limited query budget. We point out the similarity between interactive verification and another machine learning problem called contextual bandit. The similarity allows us to design interactive verification approaches from existing contextua...

 This paper presents an optimal budget distribution method for low power circuit design using transistor sizing. The algorithm distributes the available budget on the transistors optimally by an efficient traversal of the Series Parallel Graph representations of functional units. The technique can be efficiently applied at different abstraction levels of the design as well as toward other opti...

In Situ X-Ray Absorption Spectroscopic Study of Li1.05Ni0.35Co0.25Mn0.4O2 Cathode Material Coated with LiCoO2 Aniruddha Deb, Uwe Bergmann, Stephen P. Cramer, and Elton J. Cairns* Environmental Energy Technologies Division and Physical Bioscience Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA Stanford Synchrotron Radiation Laboratory, Menlo Park, California 9402...