Intensional sets in CLPDOVIER, A; PONTELLI, E; ROSSI, G et al.Lecture notes in computer science. 2003, pp 284-299, issn 0302-9743, isbn 3-540-20642-6, 16 p.Conference Paper

«Automates et contraintes ensemblistes» = «Automata and set constraints»Tommasi, Marc; Tison, Sophie.1994, 138 p.Thesis

Discovery of minimal unsatisfiable subsets of constraints using hitting set dualizationBAILEY, James; STUCKEY, Peter J.Lecture notes in computer science. 2005, pp 174-186, issn 0302-9743, isbn 3-540-24362-3, 13 p.Conference Paper

AUTOMATES, RÉÉCRITURE ET CONTRAINTES : RÉSULTATS DE DÉCIDABILITÉ ET D'INDÉCIDABILITÉ = AUTOMATA, REWRITING AND CONSTRAINTS : DECIDABILITY AND UNDECIDABILITY RESULTSSeynhaeve, Franck; Tison, Sophie.1999, 285 p.Thesis

Improved bound computation in presence of several clique constraintsPUGET, Jean-Francois.Lecture notes in computer science. 2004, pp 527-541, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

The complexity of Boolean constraint isomorphismBÖHLER, Elmar; HEMASPAANDRA, Edith; REITH, Steffen et al.Lecture notes in computer science. 2004, pp 164-175, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Contraintes ensemblistes et fonctions graduées en programmation logique avec contraintes = Set constraints and graduations in constraint logic programmingBerkaoui, Lotfi; Legeard, Bruno.1999, 136 p.Thesis

Filtering methods for symmetric cardinality constraintKOCJAN, Waldemar; KREUGER, Per.Lecture notes in computer science. 2004, pp 200-208, issn 0302-9743, isbn 3-540-21836-X, 9 p.Conference Paper

A comparison of CLP(FD) and ASP solutions to NP-complete problemsDOVIER, Agostino; FORMISANO, Andrea; PONTELLI, Enrico et al.Lecture notes in computer science. 2005, pp 67-82, issn 0302-9743, isbn 3-540-29208-X, 1Vol, 16 p.Conference Paper

The all different and global cardinality constraints on set, multiset and tuple variablesQUIMPER, Claude-Guy; WALSH, Toby.Lecture notes in computer science. 2006, pp 1-13, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 13 p.Conference Paper

Among, common and disjoint constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2006, pp 29-43, issn 0302-9743, isbn 3-540-34215-X, 1Vol, 15 p.Conference Paper

Regional and online learnable fieldsSCHATTEN, Rolf; GOERKE, Nils; ECKMILLER, Rolf et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28757-4, 2Vol, Part II, 74-83Conference Paper

Hybrid Role hierarchy for Generalized Temporal Role Based Access Control modelJOSHI, James B. D; BERTINO, Elisa; GHAFOOR, Arif et al.Proceedings - International Computer Software & Applications Conference. 2002, pp 951-956, isbn 0-7695-1727-7, 6 p.Conference Paper

On-line bicriteria interval schedulingBAILLE, Fabien; BAMPIS, Evripidis; LAFOREST, Christian et al.Lecture notes in computer science. 2005, pp 312-322, issn 0302-9743, isbn 3-540-28700-0, 11 p.Conference Paper

Smodels with CLP and its applications: A simple and effective approach to aggregates in ASPELKABANI, Islam; PONTELLI, Enrico; SON, Tran Cao et al.Lecture notes in computer science. 2004, pp 73-89, issn 0302-9743, isbn 3-540-22671-0, 17 p.Conference Paper

Multiagent matching algorithms with and without coachSTOLZENBURG, Frieder; MURRAY, Jan; STURM, Karsten et al.Lecture notes in computer science. 2003, pp 192-204, issn 0302-9743, isbn 3-540-20124-6, 13 p.Conference Paper

Consistency and propagation with multiset constraints: A formal viewpointWALSH, Toby.Lecture notes in computer science. 2003, pp 724-738, issn 0302-9743, isbn 3-540-20202-1, 15 p.Conference Paper

A hybrid constraint programming and semidefinite programming approach for the stable set problemVAN HOEVE, Willem Jan.Lecture notes in computer science. 2003, pp 407-421, issn 0302-9743, isbn 3-540-20202-1, 15 p.Conference Paper

Semi-automatic modeling by constraint acquisitionCOLETTA, Remi; BESSIERE, Christian; O'SULLIVAN, Barry et al.Lecture notes in computer science. 2003, pp 812-816, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

Improving solver success in reaching feasibility for sets of nonlinear constraints : Algorithms and computational methods in feasibility and infeasibilityIBRAHIM, Walid; CHINNECK, John W.Computers & operations research. 2008, Vol 35, Num 5, pp 1394-1411, issn 0305-0548, 18 p.Article

Décidabilité et Complexité de Systèmes de Contraintes Ensemblistes = Decidability and Comlexity of Systems of Set ConstraintsHibti, Mohamed; Lombardi, H.1995, 130 p.Thesis

The effect of deterministic noise in subgradient methodsNEDIC, Angelia; BERTSEKAS, Dimitri P.Mathematical programming (Print). 2010, Vol 125, Num 1, pp 75-99, issn 0025-5610, 25 p.Article

Multirelational k-AnonymityNERGIZ, Mehmet Ercan; CLIFTON, Christopher; NERGIZ, Ahmet Erhan et al.IEEE transactions on knowledge and data engineering. 2009, Vol 21, Num 8, pp 1104-1117, issn 1041-4347, 14 p.Article

An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problemsKRAL', Daniel; PANGRAC, Ondrej.Lecture notes in computer science. 2005, pp 603-614, issn 0302-9743, isbn 3-540-28702-7, 12 p.Conference Paper

Approximating the online set multicover problems via randomized winnowingBERMAN, Piotr; DASGUPTA, Bhaskar.Lecture notes in computer science. 2005, pp 110-121, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper