Several recent heuristics for domain independent planning adopt some action cost partitioning scheme to derive admissible heuristic estimates. Given a state, two methods for obtaining an action cost partitioning have been proposed: optimal cost partitioning, which results in the best possible heuristic estimate for that state, but requires a substantial computational effort, and ad-hoc (uniform...

Cost overruns are endemic in military procurement projects and pervasive in other areas. This paper studies a model in which the apparent cost overruns arise not as systematic expectational errors but as equilibrium phenomena. The possibility of renegotiating payments when cost overruns occur results in firms bidding below their true estimate of expected project costs. This can cause the initia...

Analog joint source-channel coding (JSCC) is a communication strategy that does not follow the separation principle of conventional digital systems but has been shown to approach the optimal distortion-cost tradeoff over additive white Gaussian noise channels. In this work, we investigate the feasibility of analog JSCC over multiple-input multiple-output (MIMO) fading channels. Since, due to co...

Network resource allocation shows revived popularity in the era of data deluge and information explosion. Existing stochastic optimization approaches fall short in attaining a desirable cost-delay tradeoff. Recognizing the central role of Lagrange multipliers in network resource allocation, a novel learn-andadapt stochastic dual gradient (LA-SDG) method is developed in this paper to learn the s...

The necessary electricity of the workshops and buildings (W&Bs;) located at the metro depot are provided by lighting power substation (LPS). To transmit electricity between LPS and W&Bs;, some trenches should be dig and the requisite cables should be located in the trenches. This paper presents a new mixed integer linear programming (MILP) long-term decision model to find ...