Des explications pour reconnatre et exploiter les structures caches

Compositions comprising 1,1,1,3,3-pentafluorobutane and more than 5% by weight of at least one non-flammable fluoro compound, and use thereof. No figures.

[1]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[2]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[3]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[4]  Narendra Jussien,et al.  The versatility of using explanations within constraint programming , 2003 .

[5]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[6]  Guillaume Cleuziou,et al.  Disjunctive Learning with a Soft-Clustering Method , 2003, ILP.

[7]  Toby Walsh,et al.  Singleton Consistencies , 2000, CP.

[8]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction: A More Accurate Picture , 1997, CP.

[9]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[10]  Hadrien Cambazard,et al.  Decomposition and Learning for a Hard Real Time Task Allocation Problem , 2004, CP.

[11]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[12]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[13]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[14]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[15]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[16]  Bart Selman,et al.  Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.

[17]  Jean-Daniel Fekete,et al.  VISEXP: Visualizing Constraint Solver Dynamics Using Explanations , 2004, FLAIRS.

[18]  Lakhdar Sais,et al.  Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem , 2001, CP.