We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
— We compare the performance of various dynamic query abolishment mechanisms in different unstructured overlay network topologies such as found in several P2P systems. We speci...
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...