about
Opposition-Based Memetic Algorithm and Hybrid Approach for Sorting Permutations by Reversals.PrefaceNominal essential intersection typesOn the average number of reversals needed to sort signed permutationsPrefaceA Compressed Suffix Tree Based Implementation With Low Peak Memory UsageHardware opposition-based PSO applied to mobile robot controllersMemetic algorithm for sorting unsigned permutations by reversalsOn the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit SubstitutionsVerification of Hardware Implementations through Correctness of their Recursive Definitions in PVSHardware-based parallel firefly algorithm for embedded applicationsParallelization and virtualization of genetic algorithms for sorting permutations by reversalsSorting Permutations by Reversals through a Hybrid Genetic Algorithm based on Breakpoint Elimination and Exact Solutions for Signed PermutationsA fast and low cost architecture developed in FPGAs for solving systems of linear equationsA genetic approach with a simple fitness function for sorting unsigned permutations by reversalsAccelerating the artificial bee colony algorithm by hardware parallel implementationsComplexity of Cayley distance and other general metrics on permutation groupsA suitable FPGA implementation of floating-point matrix inversion based on Gauss-Jordan eliminationHardware Particle Swarm Optimization with passive congregation for embedded applicationsOpposition-based shuffled PSO with passive congregation applied to FM matching synthesisTradeoff of FPGA design of floating-point transcendental functionsA Formalization of the Knuth–Bendix(–Huet) Critical Pair TheoremAccelerating the Shuffled Frog Leaping algorithm by parallel implementations in FPGAsComparison between two FPGA implementations of the Particle Swarm Optimization algorithm for high-performance embedded applicationsFPGA based floating-point library for CORDIC algorithmsHardware Particle Swarm Optimization Based on the Attractive-Repulsive Scheme for Embedded ApplicationsIntersection Type Systems and Explicit Substitutions CalculiReduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind SignaturesVerification of the Completeness of Unification Algorithms à la RobinsonA PVS Theory for Term Rewriting SystemsHardware Architecture for Particle Swarm Optimization Using Floating-Point ArithmeticParameterizable floating-point library for arithmetic operations in FPGAsPrefacePrincipal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn IndicesDistributed approach to group control of elevator systems using fuzzy logic and FPGA implementation of dispatching algorithmsFPGA implementation of dispatching algorithms for Local Control of Elevator SystemsHigher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutionsPrincipal Typings for Explicit Substitutions CalculiA variant of the Ford–Johnson algorithm that is more space efficientAn exact parallel algorithm to compare very long biological sequences in clusters of workstations
P50
Q50422470-056C8AC4-747E-47D7-B825-2856019CE2CBQ57850825-9F126EF4-C59D-4BB0-AC52-A2DBFEBB1AA7Q58001375-F5011DC1-C53D-40BA-9449-FC2D3D43A046Q58001378-37E84FB8-3645-4692-AE07-4A7CDA087319Q58001380-34538645-E155-48C3-9992-B3CB07103E92Q58001382-C16FEDFB-8E19-4A04-931F-A1B75DC0AE8CQ58001388-EE8DBA0A-CCF8-4D25-8149-578FC18FFB5BQ58001389-07D8A3FC-BEB4-4F26-8152-B1E43FFF9E19Q58001392-0253B3CA-A908-4C22-8A84-AA3F7D9B4A80Q58001394-F27B8791-30AB-4218-948A-6B640E532D25Q58001400-A6566C82-6023-489D-BB52-C0AC864C61FFQ58001405-E15A81E4-E565-4CDE-93A1-A7C5CA5C748CQ58001406-3EF3C54D-06B9-45BF-8EC7-222A0C236B9CQ58001411-7DA7F1E0-207A-4272-9904-50D2E3765A77Q58001413-7A91FFB8-0BAB-44E3-A4A5-7997F27E6C2BQ58001415-7E7A67FF-4DC7-435B-9F8D-3018BC908D5BQ58001420-3F72F2FB-5F10-419F-817F-544E66BE9B2EQ58001427-F35FBAC8-FC0E-4515-9778-DE8E5E09E1C5Q58001429-AB1B808B-0795-4DDF-BE04-1135D99F77AEQ58001433-5DC71C9C-A292-489F-BA98-D56BFC349424Q58001435-8EDC8D0D-0240-4B56-BF18-33B7AD3DA5AFQ58001438-8D9A724E-FCDE-4444-971C-F1CA37AAAB9AQ58001440-C32DB50D-ACDD-4602-B2ED-6C29E2B299AEQ58001443-2FE98D58-47FE-4361-AFBE-DE8D9825A8F7Q58001445-6A679526-28FE-4935-B9D5-FC069DFD9641Q58001446-BD015882-96AB-483B-827C-C98196DC2376Q58001448-C7449955-C8B9-4D4F-B474-AD5EEE2D9393Q58001450-AE792412-BC84-4CC0-810A-B721539DE892Q58001451-A1E3CEA5-1C37-4058-ACB3-811DC90C69B2Q58001452-531AAF1B-79A0-4132-949D-513960E96AADQ58001459-6EE4433E-A225-4009-86EB-419BD1DCC490Q58001461-EF13B636-79A2-4FCD-8D4F-00B9EDE6E9A6Q58001464-101CEACB-C8F1-41A6-A11F-0460810D2032Q58001472-9DE61BD5-C266-4ADD-820B-9EB4BAC33FD5Q58001475-748E6BF3-FFAB-4963-8318-BDFE41E8420AQ58001478-9DB1ACC5-4B3B-442F-A2BD-D0FE02850F43Q58001481-82BBA9DC-38F8-47DE-96B2-FE7CC0D41A44Q58001486-650E8556-5C35-46FB-8440-AAD890261BFDQ58001488-4A06BBBF-A239-44FE-85BF-9EB4A8A1E873Q58001491-93E3E0BC-54CA-4246-9914-95EE910D4099
P50
description
Forscher
@de
chercheur
@fr
informaticus
@nl
investigador
@es
researcher
@en
ricercatore
@it
հետազոտող
@hy
研究者
@zh
name
Mauricio Ayala-Rincon
@ast
Mauricio Ayala-Rincon
@en
Mauricio Ayala-Rincon
@es
Mauricio Ayala-Rincon
@nl
type
label
Mauricio Ayala-Rincon
@ast
Mauricio Ayala-Rincon
@en
Mauricio Ayala-Rincon
@es
Mauricio Ayala-Rincon
@nl
altLabel
Mauricio Ayala-Rincón
@en
prefLabel
Mauricio Ayala-Rincon
@ast
Mauricio Ayala-Rincon
@en
Mauricio Ayala-Rincon
@es
Mauricio Ayala-Rincon
@nl
P214
P227
P1053
C-3432-2015
P1153
6507737823
P21
P213
0000 0001 3991 0800
P214
P227
1014950791
P31
P3829
P496
0000-0003-0089-3905
P7859
lccn-no2010089399