This paper presents an integer linear programming (ILP) technique to partition and schedule Synchronous Data Flow (SDF) graphs onto heterogeneous execution architectures. Our ILP formulation gives a partition and schedule for SDF graphs, which provide the optimal execution time. We incorporate new methods of exploiting stateless data-parallelism on a heterogeneous architecture. We quantitativel...

The insulin/insulin-like peptides (ILPs) regulate key events in physiology, including neural plasticity. However, the cellular and circuit mechanisms whereby ILPs regulate learning remain largely unknown. Here, we characterize two ILPs that play antagonistic roles in aversive olfactory learning of C. elegans. We show that the ILP ins-6 acts from ASI sensory neurons to enable learning by repress...

Inductive logic programming (ILP) is built on a foundation laid by research in machine learning and computational logic. Armed with this strong foundation, ILP has been applied to important and interesting problems in the life sciences, engineering and the arts. This paper begins by briefly reviewing some example applications, in order to illustrate the benefits of ILP. In turn, the application...

Open-ended learning is regarded as the ultimate milestone, especially in intelligent robotics. Preferably it should be unsupervised and it is by its nature inductive. In this article we want to give an overview of attempts to use Inductive Logic Programming (ILP) as a machine learning technique in the context of embodied autonomous agents. Relatively few such attempts exist altogether and the m...

Building a natural language interface for a database has been an interesting task since the 70‟s, which often requires creating a semantic parser. A study on using an advanced inductive logic programming (ILP) approach for semantic parser induction that combines different ILP learners to learn rules for ambiguity resolution is presented. Accuracy of the resulting induced semantic parser can be ...

The 3-partition problem admits a straightforward formulation as a 0-1 Integer Linear Program (ILP). We investigate problem instances for which the half-integer relaxation of the ILP is feasible, while the ILP is not. We prove that this only occurs on a set of at least 18 elements, and in case of 18 elements such an instance always contains an element of weight ≥ 10. These bounds are sharp: we g...

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 ...

In this work we introduce a new hard problem in lattices called Isometric Lattice Problem (ILP) and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this problem. We also show that this problem has an (efficient prover) perfect zero-knowledge interactive proof; this is the only hard problem in lattices that is known to have this property (with respect to malicious verif...

The handling of exceptions in multiclass problems is a tricky issue in inductive logic programming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one c...