Categoría: "Ciencias de la Información y la Computación"

236 contenidos encontrados.
Centro Investigación en Educación Superior

The Underlying Social Dynamics of Paradigm Shifts

We develop here a multi-agent model of the creation of knowledge (scientific progress or technological evolution) within a community of […]

Centro Investigación en Educación Superior

Software project scheduling using the hyper – cube ant colony optimitation algorithm

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 […]

Centro Investigación en Educación Superior

Multi-objective Robust Optimization using a Post-optimality Sensitivity Analysis Technique: Application to a Wind Turbine Design

Toward a multi-objective optimization robust problem, the variations in design variables and design environment parameters include the small variations and […]

Centro Investigación en Educación Superior

Top-? Based Adaptive Enumeration in Constraint Programming

Constraint programming effectively solves constraint satisfaction and optimization problems by basically building, pruning, and exploring a search tree of potential solutions. In this context, […]

Centro Investigación en Educación Superior

Boosting autonomous search for CSPs via skylines

Solving constraint satisfaction problems via constraint programming involves the exploration of a search tree where the potential solutions are distributed. […]

Centro Investigación en Educación Superior

A Hybrid alldifferent-Tabu Search Algorithm for Solving Sudoku Puzzles

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 […]

Centro Investigación en Educación Superior

Set constraint model and automated encoding into SAT: application to the social golfer problem

On the one hand, constraint satisfaction problems allow one to expressively model problems. On the other hand, propositional satisfiability problem […]

Centro Investigación en Educación Superior

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering 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 […]

Centro Investigación en Educación Superior

Adaptive filtering strategy for numerical constraint satisfaction problems

The reliability and increasing performance of search-tree-based interval solvers for solving numerical systems of constraints make them applicable to various […]

236 contenidos encontrados.
Saltar a la barra de herramientas