This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Abstract. This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bd...
Nardine Osman, David Robertson, Christopher Walton
Web services are designed for composition and use by third parties through dynamic discovery. As such, the issue of interoperability between services is of great importance to ens...
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...