Constraint-based approaches recently brought new insight into our understanding of
metabolism. By making very simple assumptions such as that the system is at steady-state …

An enumeration problem is the task of listing a set of elements without redundancies, usually
the solutions of some combinatorial problem. The enumeration of cycles in a graph …

We investigate whether the pseudo-intents of a given formal context can efficiently be
enumerated. We show that they cannot be enumerated in a specified lexicographic order …

BACKGROUND The invention relates generally to ontology processing, and relates more
particularly to ontology security. A central issue under consideration by the WorldWideWeb …

Монография посвящена оценке и обеспечению режимной и балансовой надежности
электроэнергетических систем. Дана оригинальная трактовка структуры свойства …

"Manuscript title" Page 1 UNIVERSITE DE VERSAILLES SAINT-QUENTIN-EN-YVELINES
Laboratoire Données et Algorithmes pour une Ville Intelligente et Durable David – UR 7431 …

The question if a given partial solution to a problem can be extended reasonably occurs in
many algorithmic approaches for optimization problems. For instance, when enumerating …

This paper focuses on the description and computation of the B-differential of the
componentwise minimum of two affine vector functions. This issue arises in the reformulation …

We investigate the relationship between several enumeration complexity classes and focus
in particular on problems having enumeration algorithms with incremental and polynomial …

In this paper we address the problem of generating all elements obtained by the saturation
of an initial set by some operations. More precisely, we prove that we can generate the …