In this paper we describe a benchmark generator for a family of cost aware resource constraints. These constraints have been introduced in the context of electricity cost minimization, but can also be applied for other use cases like manpower scheduling. None of the existing resource constraint benchmarks include a cost element, we therefore created our own test generator to evaluate the qualit...

This paper introduces a novel unsupervised constraint-driven learning algorithm for identifying named-entity (NE) transliterations in bilingual corpora. The proposed method does not require any annotated data or aligned corpora. Instead, it is bootstrapped using a simple resource – a romanization table. We show that this resource, when used in conjunction with constraints, can efficiently ident...

A problem of designing conflict-free schedules for concurrent repetitive manufacturing processes using resources in mutual exclusion is considered. Processes that share resources can wait for resources (machines) required to complete successive operations in their production routes. Systems of processes sharing only one resource are considered. A problem of finding operation times and starting ...

Performance of a resource-efficient provisioning framework (RPF) is evaluated in this paper in wavelengthcontinuous optical networks under static traffic. The structure of the survivable routing problem is unraveled by an integer linear programming (ILP) model. Numerical results from direct ILP approaches show that the RPF still achieves more than 10% capacity savings over the traditional provi...

Most of the semiconductor companies are targeting multi-core processor for high-end embedded systems. Programming such processors for performance is quite cumbersome without proper development tools. Conventional mapping algorithms fail to address the issues of tight resource constraint found in embedded applications running on these processors. We present resource constraint based application-...

An Incremental Elicitation Approach to Limited-Precision Auctions Alexander Kress Master of Science Graduate Department of Computer Science University of Toronto 2004 Auction-based mechanisms are increasingly being used for automating resource allocation among large numbers of agents. To make these sort of mechanisms viable one needs to consider the issues of communication and computation expen...

Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...