-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...
Ting He, Kang-Won Lee, Nikoletta Sofra, Kin K. Leu...
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
In this paper we consider how to efficiently identify tags on the moving conveyor. Considering conditions like the path loss and multi-path effect in realistic settings, we first p...
Lei Xie, Bo Sheng, Chiu Chiang Tan, Hao Han, Qun L...
How to reuse or adapt past solutions to new problems is one of the least understood problems in case-based reasoning. In this paper we will focus on the problem of how to combine s...
While multimodal interfaces are becoming more and more used and supported, their development is still difficult and there is a lack of authoring tools for this purpose. The goal of...
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
: The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solu...