[图书][B] Recent advances in learning automata

A Rezvanian, AM Saghiri, SM Vahidipour… - 2018 - Springer
This book is written for computer engineers, scientists, and students studying/working in
reinforcement learning and artificial intelligence domains. The book collects recent …

Variable Neighborhood Search for precedence-constrained tasks optimization on heterogeneous systems

AHG Ruiz, AAS Pineda, JAC Rocha, SI Martínez… - Expert Systems with …, 2024 - Elsevier
Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …

Grasp and iterated local search-based cellular processing algorithm for precedence-constraint task list scheduling on heterogeneous systems

A Santiago, JD Terán-Villanueva, SI Martínez… - Applied Sciences, 2020 - mdpi.com
High-Performance Computing systems rely on the software's capability to be highly
parallelized in individual computing tasks. However, even with a high parallelization level …

Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem

SM Vahidipour, MR Meybodi, M Esnaashari - Discrete Event Dynamic …, 2017 - Springer
In a Petri net, a decision point is raised when two or more transitions are simultaneously
enabled in a given marking. The decision to be made at such a point is the selection of an …

Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design

JD Terán-Villanueva, HJ Fraire-Huacuja, SI Martínez… - Information …, 2019 - Elsevier
The vertex bisection problem splits a graph G=(V, E) into two sets, L⊆ V,| L|=⌊| V|/2⌋ and
R= V∖ L, such that it minimizes the number of vertices in L connected to R. This problem is a …

Algorithms solving the Internet shopping optimization problem with price discounts

J Musial, JE Pecero, MC Lopez-Loces… - Bulletin of the Polish …, 2016 - journals.pan.pl
The Internet shopping optimization problem arises when a customer aims to purchase a list
of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the …

Variable Neighborhood Search for precedence-constrained tasks optimization on heterogeneous systems

AH García Ruiz, AA Santiago Pineda… - 2024 - dl.acm.org
Supercomputing power is one of the fundamental pillars of the digital society, which
depends on the accurate scheduling of parallel applications in High-Performance …

A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems

JD Terán-Villanueva, HJ Fraire Huacuja… - Computational …, 2015 - Springer
In this paper, the NP-hard problem of minimizing power consumption in wireless
communications systems is approached. In the literature, several metaheuristic approaches …

How to efficiently solve Internet Shopping Optimization Problem with price sensitive discounts?

J Musial, JE Pecero, MC Lopez… - … Conference on e …, 2014 - ieeexplore.ieee.org
In this paper we deal with the Internet Shopping Optimization Problem. An extended model
that includes price sensitive discounts is considered. A set of algorithms to solve the Internet …

[PDF][PDF] Discrete singular convolution for Lennard-Jones potential using Shannon kernel

MG Majumdar - Int J Phys Sci, 2013 - academicjournals.org
In this paper, the idea of discrete singular convolution (DSC) as a viable computation
method for analyzing physical systems has been underlined. Discrete singular convolution …