Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
Abstract-- A novel algorithm to solve constrained realparameter optimization problems, based on the Artificial Bee Colony algorithm is introduced in this paper. The operators used ...
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...