Fargier, H. (1994). Problemes de satisfaction de contraintes flexibles: application a l'ordonnancement de production, PhD thesis, Universite P. Sabatier, Toulouse. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computing Improved Optimal Solutions to Max-Min Flexible.. - Dubois, Fortemps (1999) (1 citation) (Correct)
.... criteria decision making often involves compensatory connectives (e.g. Keeney and Rai#a 1976) The maximin framework for constraint satisfaction problems has been first suggested by Freuder and Snow (1989) and fully developed by Dubois, Fargier and Prade (Dubois et al. 1996, Dubois et al. 1994, Fargier 1994). A major advantage of this framework is that not only it enables a better 1 discrimination between good and less good solutions to a set of constraints, but all the machinery of constraint propagation extends over to flexible constraints: levels of preference can be propagated using simple ....
.... is that not only it enables a better 1 discrimination between good and less good solutions to a set of constraints, but all the machinery of constraint propagation extends over to flexible constraints: levels of preference can be propagated using simple extensions of existing algorithms (e.g. Fargier 1994, Dubois et al. 1996) so as to visualize fuzzy sets of feasible solutions to a problem. This approach has been successfully applied to jobshop scheduling (Dubois et al. 1995, Fargier 1997) where the fuzzy constraint formulation is general enough to subsume constraint based approaches (Erschler et ....
[Article contains additional citation context not shown here]
Fargier, H. (1994). Problemes de satisfaction de contraintes flexibles: application a l'ordonnancement de production, PhD thesis, Universite P. Sabatier, Toulouse.
Problèmes De Satisfaction De Contraintes Values - Schiex, Fargier, Verfaillie Self-citation (Fargier) (Correct)
....nombre important de travaux aient tente d apporter des reponses aux problemes de prise en compte d incertitudes, de preferences et d imprecisions sur les donnees. Nous citerons pour memoire les travaux de [ROS 76, SHA 81, HER 88, FRE 89, DEC 90, SCH 92, MC 92, FRE 92, BOW 92, BRE 92, FAR 93a, FAR 94a, FAR 94b, RUT 94, GUE 94] qui offrent chacun : une extension du formalisme CSP permettant d evaluer une solution potentielle en terme de cou t [SHA 81, FRE 92] de possibilite [ROS 76, FAR 94a] de priorite [SCH 92] de probabilite [FAR 93a] une panoplie algorithmique pour resoudre les ....
.... travaux de [ROS 76, SHA 81, HER 88, FRE 89, DEC 90, SCH 92, MC 92, FRE 92, BOW 92, BRE 92, FAR 93a, FAR 94a, FAR 94b, RUT 94, GUE 94] qui offrent chacun : une extension du formalisme CSP permettant d evaluer une solution potentielle en terme de cou t [SHA 81, FRE 92] de possibilite [ROS 76, FAR 94a] de priorite [SCH 92] de probabilite [FAR 93a] une panoplie algorithmique pour resoudre les extensions des problemes traditionnels du cadre CSP : etablissement d un certain niveau de coherence, recherche de solutions. Dans toutes ces approches, les contraintes , qu elles soient ( dures ....
[Article contains additional citation context not shown here]
FARGIER H., Problemes de satisfaction de contraintes flexibles et application a l'ordonnancement de production, Toulouse, France, These de doctorat, Universite Paul Sabatier -- Institut de Recherche en Informatique de Toulouse, juin 1994.
Autour Du Problème De Satisfaction De Contraintes - Bellicha, Neveu, Trousse.. (1994) Self-citation (Helene) (Correct)
....n est totalement acceptable, les meilleures solutions sont celles qui maximisent le degre de satisfaction de la moins satisfaite des contraintes. Ce modele, qui revient a un probleme d optimisation de type max min, a ete etudie (sous sa forme generale ou sous des formes plus specifiques) dans [50, 59, 26] 1 . Un raffinement du critere d optimalite max min fonde sur l utilisation d un ordre lexicographique permettant de departager les solutions realisables jugees equivalentes par le critere max min a ete etudie dans [31] Une approche utilitariste (additive) ou les degres de satisfaction sont ....
....d independance et de commensurabilite, il a ete possible de prendre en compte des contraintes dont on n est sur qu a un certain degre qu elles appartiennent au probleme reel; il s agit encore de rechercher une solution qui maximise la certitude que le probleme reel sera satisfait. Ce travail [26] constitue un premier pas vers l introduction des deux types de valuations (preferences et incertitudes) dans les CSP. Il est a priori moins naturel d integrer directement des preferences de nature qualitative avec de l incertitude probabiliste, du fait de l heterogeneite des modeles de reference. ....
Fargier (Helene). -- Problemes de satisfaction de contraintes flexibles et application a l'ordonnancement de production. -- Toulouse, France, These nouveau regime, Universite Paul Sabatier -- Institut de Recherche in Informatique de Toulouse, juin 1994.
Valued Constraint Satisfaction Problems: Hard and Easy Problems - Schiex (1995) (104 citations) Self-citation (Fargier) (Correct)
....v and conversely. Thus, using binary search, the optimal assignment in a Max VCSP can be found in a logarithmic number of resolution of a classical CSP. Indeed, all the traditional polynomial classes and problems (k consistency enforcing. of classical CSP can be extended to Max VCSP in this way [Fargier, 1994] . Stricly monotonic classes: in this section, we put Pi VCSP aside because Pi VCSP combination operator relies on multiplication of real numbers. However, note that if we also relax the integrity constraint on penalties in Sigma VCSP (penalties are allowed to take values in R instead of N) ....
....associated to the father of the current node is aggregated with the valuations of all the constraints violated by x i using . The generic VCSP algorithm defined encompass all the Branch and Bound algorithms defined for Max VCSP or Sigma VCSP in [Schiex, 1992; Freuder and Wallace, 1992; Fargier, 1994; Ruttkay, 1994] Note that for Max VCSP, thanks to idempotency, it is useless to test whether constraints whose valuation is lower than the lower bound associated to the father node have to be rejected since their rejection cannot influence the bound. 4.4 Extending Forward Checking ....
[Article contains additional citation context not shown here]
Helene Fargier. Problemes de satisfaction de contraintes flexibles et application a l'ordonnancement de production. Phd thesis (in french), Institut de Rechercheen Informatique de Toulouse, France, June 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC