An error recovery method for translations of LL(1)-languages [Abstract of thesis]
The success of machine learning methods for inducing models from data crucially depends on the proper incorporation of background knowledge about the model to be learned. The idea of constraint-regularized learning is to employ fuzzy set-based modeling techniques in order to express such knowledge in a flexible way, and to formalize it in terms of fuzzy constraints. Thus, background knowledge can be used to appropriately bias the learn ing process within the regularization framework of inductive...
The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced....
We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.
We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.
Motivation for this paper are classification problems in which data can not be clearly divided into positive and negative examples, especially data in which there is a monotone hierarchy (degree, preference) of more or less positive (negative) examples. We present a new formulation of a fuzzy inductive logic programming task in the framework of fuzzy logic in narrow sense. Our construction is based on a syntactical equivalence of fuzzy logic programs FLP and a restricted class of generalised annotated...