scispace - formally typeset
J

Juan Paulo Alvarado-Magaña

Researcher at Autonomous University of Baja California

Publications -  5
Citations -  18

Juan Paulo Alvarado-Magaña is an academic researcher from Autonomous University of Baja California. The author has contributed to research in topics: Worst-case execution time & Grammar. The author has an hindex of 3, co-authored 5 publications receiving 16 citations. Previous affiliations of Juan Paulo Alvarado-Magaña include Ensenada Center for Scientific Research and Higher Education.

Papers
More filters
Book ChapterDOI

Type-2 Fuzzy Grammar in Language Evolution

TL;DR: A new approach to simulating language evolution is proposed and a Type-2 Fuzzy Grammar is introduced, which is able to gradually adopt a foreign language by adjusting the grades of membership of their grammar.
Journal ArticleDOI

Analysis of the average execution time for a self-stabilizing leader election algorithm

TL;DR: This paper eliminates the daemon from this algorithm by making random choices to avoid interference between neighboring nodes, and shows that the average execution time for this algorithm, assuming two different scenarios, is much lower than O(N4).
Book ChapterDOI

Type-2 Fuzzy Logic Grammars in Language Evolution

TL;DR: A new approach to simulating language evolution is proposed and a Type-2 Fuzzy Grammar is introduced, which is able to gradually adopt a foreign language by adjusting the grades of membership of their grammar.
Proceedings ArticleDOI

Simulation of language evolution using Fuzzy Grammars

TL;DR: A new approach based on modifications to the classic Ant Colony Optimization algorithm is proposed, provided with a Fuzzy Grammar and the ability to embed a message in the pheromone.
Proceedings ArticleDOI

Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm

TL;DR: This paper eliminates the daemon from the self-stabilizing leader election algorithm of Xu and Srimani by making random choices to avoid interference between neighbor nodes, and shows that the average execution time for this algorithm is much lower than O(N4).