Parallel resource and machine scheduling received a lot of attentions in the literature. In most of parallel scheduling models, the numbers of resources or machines that jobs must be assigned at each time unit are the inputs of the problems, i.e., jobs cannot be assigned to arbitrary numbers of resources or machines at the same time unit. In this paper, we consider the following scheduling prob...

We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagator into a constraint solver based on an MDD store introduced in [1]. Our experiments show that the new propagator provides substantial computational advantage over propagation of two inequality constraints, and that t...

A data warehouse stores materialized views derived from one or more sources for the purpose of e ciently implementing decisionsupport or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and/or the cost...

Test cost is often required to obtain feature values of an object. When this issue is involved, people are often interested in schemes minimizing it. In many data mining applications, due to economic, technological and legal reasons, it is neither possible nor necessary to obtain a classifier with 100% accuracy. There may be an industrial standard to indicate the accuracy of the classification....

Simultaneous optimization of time, cost, and utilized resources in a construction project is vital. This paper presents a GA based model for determination of the best combination of the time, cost, and resources in a multiple resource constraint problem. The proposed model considers both resource allocation and leveling simultaneously. Since the problem is assumed to be resource constraint, res...

Abduction is the problem of nding the best explanation for a given set of observations. Within AI, this has been modeled as proving the observation by assuming some set of hypotheses. Cost-based abduction associates a cost with each hypothesis. The best proof is the one which assumes the least costly set. Previous approaches to nding the least cost set have formalized cost-based abduction as a ...

In maintaining consistencies, such as GAC*, FDGAC* and weak EDGAC*, for global cost functions, Weighted CSP (WCSP) solvers rely on the projection and extension operations, which entail the computation of the cost functions’ minima. Tractability of this minimum computation is essential for efficient execution. Since projections/extensions modify the cost functions, an important issue is tractabl...

We develop a theory of how agency conflicts between the shareholders and debt holders of a financial institution, accounting measurement rules, and prudential capital regulation interact to affect the institution’s capital structure and project choices. We show that, relative to a benchmark historical cost regime in which assets and liabilities on the institution’s balance sheet are measured at...

Recent papers [3,4,16] have introduced dual-mode MPC algorithms using a time-varying terminal cost and/or constraint. The advantage of these methods is the enlargement of the admissible set of initial states whithout sacrificing local optimality of the controller, but this comes at the cost of a higher computational complexity. This paper delivers two main contributions in this area. First, a n...

This paper presents a normalized subband adaptive filtering (NSAF) algorithm to cope with the sparsity condition of an underlying system in the context of compressive sensing. By regularizing a weighted l1-norm of the filter taps estimate onto the cost function of the NSAF and utilizing a subgradient analysis, the update recursion of the l1-norm constraint NSAF is derived. Considering two disti...