Our interest in this paper is in optimisation problems that are intractable to solve by direct numerical optimisation, but nevertheless have significant amounts of relevant domain-specific knowledge. The category of heuristic search techniques known as estimation of distribution algorithms (EDAs) seek to incrementally sample from probability distributions in which optimal (or near-optimal) solu...

In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associat...

We study a balanced academic curriculum problem and an industrial steel mill slab design problem. These problems can be modelled in different ways, using both Integer Linear Programming (ILP) and Constraint Programming (CP) techniques. We consider the utility of each model. We also propose integrating the models to create hybrids that benefit from the complementary strengths of each model. Expe...

A rat colon tumour model of liver metastases was used to administer 5-fluorouracil (5FU) by intraperitoneal (i.p.) bolus injection (50 mg/kg), isolated liver perfusion (ILP, 150 mg/kg) and hepatic artery infusion (HAI, 50 mg/kg). The biochemical effect of 5FU, delivered by different routes, on its target enzyme thymidylate synthase (TS) was studied in both tumour and normal tissues of the rat. ...

The frequency assignment problem (FAP) arises in wireless communication networks, such as cellular phone communication systems, television broadcasting, WLANs, and military communication systems. In all these applications, the task is to assign frequencies to a set of transmitters, subject to interference constraints. The exact form of the constraints and the objective function vary according t...

Stochastically searching the space of candidate clauses is an appealing way to scale up ILP to large datasets. We address an approach that uses a Bayesian network model to adaptively guide search in this space. We examine guiding search towards areas that previously performed well and towards areas that ILP has not yet thoroughly explored. We show improvement in area under the curve for recall-...

Inhibitor of apoptosis protein (IAP)-like protein-1 (ILP-1) (also known as X-linked IAP [XIAP] and mammalian IAP homolog A [MIHA]) is a potent inhibitor of apoptosis and exerts its effects, at least in part, by the direct association with and inhibition of specific caspases. Here, we describe the molecular cloning and characterization of a human gene related to ILP-1, termed ILP-2. Despite high...

We report on our work to build a discourse parser (SemDP) that uses semantic features of sentences. We use an Inductive Logic Programming (ILP) System to exploit rich verb semantics of clauses to induce rules for discourse parsing. We demonstrate that ILP can be used to learn from highly structured natural language data and that the performance of a discourse parsing model that only uses semant...

Standard pairwise coreference resolution systems are subject to errors resulting from their performing anaphora identification as an implicit part of coreference resolution. In this paper, we propose an integer linear programming (ILP) formulation for coreference resolution which models anaphoricity and coreference as a joint task, such that each local model informs the other for the final assi...

Healthcare facilities, especially hospitals, are under financial pressure to control cost. One element that affects cost significantly is staff. We have developed a tool that integrates a simulation model and an integer linear program (ILP). The simulation model establishes the staffing requirements for each period, and the ILP produces an optimal calendar schedule for the staff, i.e. how many ...