This paper revises notions related to Language Resources and Technologies (LRT), including a brief overview of some resources developed worldwide and with a special focus on Roman...
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
The paper proposes a formal delimitation of the class of `fuzzy logics' and answers some objections that can be raised against the definition; the focus is put on informal an...