This paper presents the principles of a home automation system dedicated to power
management that adapts power consumption to available power ressources according to …

The propositional Satisfiability problem (SAT) is one of the most studied in computer science
since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the …

This paper presents the principles of a Home Automation System dedicated to power
management that adapts power consumption to available power ressources according to …

This paper presents and investigates for the first time a new trail for parallel solving of the
Satisfiability problem based on a simple and efficient structural decomposition heuristic. A …

The last decade progresses have led the Satisfiability Problem (sat) to be a great and
competitive practical approach to solve a wide range of industrial and academic problems …

The past few years have seen enormous progress in the performance of propositional
satisfiability (SAT) solving, and consequently SAT solvers are widely used in industry for …

Conditional nonlinear optimal perturbation (CNOP) has been widely applied to predictability
and sensitivity studies of nonlinear models. The popular methods of solving CNOP can be …

In this paper, a general approach for solving combinatorial problems in parallel is proposed.
This study is done using the Constraint Satisfaction Problems (CSPs) formalism. The tasks …

Cette thèse concerne à la gestion globale à base de modèle des flux énergétiques dans le
bâtiment. L'objectif des systèmes de gestion de l'énergie proposés est d'aider les occupants …

The boolean satisfiability problem sat is a well-known NP-Complete problem, which is
widely studied because of its conceptual simplicity. Nowadays the number of existing …