Buscar en RiuNet

Listar

Mostrando ítems 1-3 de 3

Design and development of CSP techniques for finding robust solutions in job-shop scheduling problems with Operators

Escamilla Fuster, Joan (Universitat Politècnica de València, 2012-12-03)

[ES] Se desarrolla una técnica CSP para buscar soluciones robustas en el problema job-shop scheduling. La técnica esta desarrollada en tres pasos. El primer paso resuelve el problema sin tener en cuenta operadores. El ...
Robustness in Dynamic Constraint Satisfaction Problems

Climent Aunés, Laura Isabel; Salido Gregorio, Miguel Angel; Barber Sanchís, Federico (ICIC International, 2012)

[EN] Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems are dynamic, which means that the initial description ...
Soft-GORA: Soft Constrained Globally Optimal Resource Allocation for Critical Links in loT Backhaul Communication

Iqbal, Saleem; Abdullah, Abdul Hanan; Qureshi, Kashif Naseer; Lloret, Jaime (Institute of Electrical and Electronics Engineers, 2018)

[EN] The Internet of Things gateways with multi-radio facilities in wireless networks can simultaneously communicate using multiple available channels. This feature enhances the carrying capacity of wireless links and thus ...

Mostrando ítems 1-3 de 3