We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are presen...
Jean-Claude Bermond, Nicolas Nisse, Patricio Reyes...
—The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and h...
Hamza Drid, Bernard Cousin, Samer Lahoud, Mikl&oac...
: Performance modeling for scientific production codes is of interest both for program tuning and for the selection of new machines. An empirical method is used for developing a m...
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...