We develop here a multi-agent model of the creation of knowledge (scientific progress or technological evolution) within a community of […]
This paper introduces a proposal of design of Ant Colony Optimization algorithm paradigm using Hyper-Cube framework to solve the Software ProjectScheduling Problem. This NP-hard problem consists in assigning tasks to employees […]
Toward a multi-objective optimization robust problem, the variations in design variables and design environment parameters include the small variations and […]
Constraint programming effectively solves constraint satisfaction and optimization problems by basically building, pruning, and exploring a search tree of potential solutions. In this context, […]
Solving constraint satisfaction problems via constraint programming involves the exploration of a search tree where the potential solutions are distributed. […]
The Sudoku problem is a well-known logic-based puzzle of combinatorial number-placement. It consists in filling a n2 × n2 grid, composed of n columns, n rows, and […]
On the one hand, constraint satisfaction problems allow one to expressively model problems. On the other hand, propositional satisfiability problem […]
The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the […]
The reliability and increasing performance of search-tree-based interval solvers for solving numerical systems of constraints make them applicable to various […]
