We show that an interior-pointmethodfor monotonevariationalinequalitiesexhibits superlinear convergence provided that all the standard assumptions hold except for the well-known as...
A crowd is not only a group of many individuals. Crowd modelling involves problems that arise only when we focus on crowds. For instance, avoiding collision problems related to a ...
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...