Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
We introduce and study qualitative multiple outcomes games. These games are noncooperative games with qualitative utilities (i.e., values over an ordinal scale), strictly qualitat...
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...