A novel integer linear programming (ILP) formulation for resource-constrained scheduling problems is presented. Existing ILP-based methods for the same problem typically have a complexity (measured in terms of the number of unknown integer variables) that is proportional to the latency bound of the problem. Hence, they are restricted in scope (e.g., high-level synthesis). Our approach consists ...

In each submodel, the memory system is viewed as a system of queues (e.g., the memory bus, DRAM modules and associated directories, and network interfaces) and delay centers (e.g., switches in the interconnection network). We create a set of intuitive customized mean value analysis (CMVA) equations to obtain estimates of throughput (instructions per cycle) in each submodel. The CMVA technique h...

By site-directed mutagenesis, six insulin residues related to the insulin-receptor interaction were grafted, partially or fully, onto the corresponding position of a recombinant amphioxus insulin-like peptide (ILP) that contained the A- and B-domains of the deduced amphioxus ILP. After fermentation, purification, and enzymatic cleavage, six insulin-like double-chain ILP analogues were obtained:...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

In Software-Defined Networking (SDN), the control and data planes are decoupled, leading to a more programmable efficient network management. this paper, controller placement problem in SDN is addressed, jointly with of exploring high-availability tree subgraph, order support delay availability requirements between switches controllers. We consider that each switch connects primary backup contr...

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 Inductive Logic Programming (ILP) systems use a greedy covering algorithm to nd a set of clauses that best model positive examples. This set of clauses is called a theory and can be seen as an ensemble of clauses. It turns out that the search for a theory within the ILP system is very time consuming and often yields overly complex classi ers. One alternative approach to obtain a theory is ...

The increasing size and complexity of communication satellites has made the manual management of their payloads by engineers through computerised schematics difficult and error prone. This article proposes to optimise payload reconfigurations for current and next generation satellites using a novel Integer Linear Programming model (ILP), which is a variant of network flow models. Experimental r...

The oriented non-guillotine two-dimensional strip packing problem is investigated. Several 1D relaxations are considered and compared. Moreover, an ILP formulation of the 1D contiguous relaxation is given. The appropriate combination of some of the relaxations enables us the formulate a new ILP model of the strip packing problem.