Elegir campos a generar del autor Leocadio

Datos personales Todos / Ninguno
Correo Electrónico
Artículos Todos / Ninguno
Local search versus linear programming to detect monotonicity in simplicial branch and bound
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound
On monotonicity and search strategies in face-based copositivity detection algorithms
Iniciativa basada en Kahoot para motivar a los alumnos de Arquitectura de Computadores
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
On derivative based bounding for simplicial branch and bound
An SDN approach to detect targeted attacks in P2P fully connected overlays
On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization
Preface: Special issue Europt 2018
Reducing Streaming Cost While Increasing Privacy A case study on a smartphone and Chromecast using peer-to-peer technology to skip third-party servers
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU
On parallel Branch and Bound frameworks for Global Optimization
Security analysis and resource requirements of group-oriented user access control for hardware-constrained wireless network services
On refinement of the unit simplex using regular simplices
Preface: special issue MAGO 2014
On Bisecting the Unit Simplex Using Various Distance Norms
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex
Erratum to: Pareto optimality and robustness in bi-blending problems
Pareto optimality and robustness in bi-blending problems
Eco-Evolutionary Spatial Dynamics: Rapid Evolution and Isolation Explain Food Web Persistence
Seeking water while avoiding predators: moisture gradients can affect predator-prey interactions
Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform
An updated view on centralized secure group communications
On estimating workload in interval branch-and-bound global optimization algorithms
On interval branch-and-bound for additively separable functions with common variables
A threaded approach of the quadratic bi-blending algorithm
Enabling User Access Control in Energy-constrained Wireless Smart Environments
Message from the workshop chairs HPCO 2013
Asynchronous privacy-preserving iterative computation on peer-to-peer networks
A suite of algorithms for key distribution and authentication in centralized secure multicast environments
On determining the cover of a simplex by spheres centered at its vertices
Group Oriented Renewal of Secrets and Its Application to Secure Multicast
Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures
The semi-continuous quadratic mixture design problem:: Description and branch-and-bound approach
Branch-and-bound interval global optimization on shared memory multiprocessors
About the Codes Used
Approximate Circle Packings Using Optimization Methods
Bounds for the Optimum Values
Interval Methods for Validating Optimal Solutions
Introduction and Problem History
Minimal Polynomials of Point Arrangements
Other Methods for Finding Approximate Circle Packings
Problem Definitions and Formulations
Repeated Patterns in Circle Packings
The First Fully Interval-based Optimization Method
The Improved Version of the Interval Optimization Method
Currently Best Known Results for Packing Congruent Circles in a Square
Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Interval parallel global optimization with Charm plus
New interval methods for constrained global optimization
On an efficient use of gradient information for accelerating interval global optimization algorithms
Heuristic rejection in interval global optimization
New interval analysis support functions using gradient information in a global minimization algorithm
Interval algorithms for finding the minimal root in a set of multiextremal one-dimensional nondifferentiable functions
Experiments with a new selection criterion in a fast interval optimization algorithm
A heuristic rejection criterion in interval global optimization algorithms
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions
A new multisection technique in interval methods for global optimization
Libros o capítulos Todos / Ninguno
On parallelizing Set Inversion by Interval Analysis
Copositividad de una matriz: retos computacionales
Proceedings of the XII Global Optimization Workshop: mathematical and applied global optimization, MAGO 2014
Honeypots and honeynets: Analysis and case study
NEW APPROACHES TO CIRCLE PACKING IN A SQUARE With Program Codes Preface
Manual de Linux y Tcl-Tk
Tesis Todos / Ninguno
Computación de altas prestaciones para la resolución de problemas de optimización global
Eficiencia y seguridad en protocolos de streaming peer-to_peer
Bisección iterativa de un símplex regular: paralelización
Algoritmos multihebrados adaptativos en sistemas no dedicados.
High performance computing in deterministic global optimization
Contributions to secure multicast and privacy-preserving computations on peer-to-peer networks
Optimización global intervalar: predicción, acotación y separabilidad
Interval methods for competitive location problems
Métodos de acotación en algoritmos de optimización global intervalar : paralelización
Optimización global basada en aritmetica de intervalos y ramificación y acotacion: paralelizacion
Conferencias Todos / Ninguno
HUAWEI ICT ACADEMY: A KEY RESOURCE FOR COMPUTER ENGINEERING EDUCATION
On Polytopal Branch and Bound with Monotonicity
On Monotonicity Detection in Simplicial Branch and Bound over a Simplex
QUANTUM LOGIC GATES FOR STUDENTS OF COMPUTER ENGINEERING: A NEW LEARNING METHOD
On Function Monotonicity in Simplicial Branch and Bound
On Regular Simplex Division in Copositivity Detection
COLLABORATIVE PROJECT-BASED LEARNING: AN EXPERIENCE
LEARNING QUANTUM COMPUTATION THROUGH SIMPLE EXAMPLES
On Mitigating Pollution and Free-Riding Attacks by Shamir's Secret Sharing in Fully Connected P2P Systems
EDUCATIONAL STRATEGIES BASED ON LOW-COST PLATFORMS IN THE AREA OF COMPUTER ENGINEERING
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size
On Pollution Attacks in Fully Connected P2P Networks Using Trusted Peers
Heuristics for Longest Edge Selection in Simplicial Branch and Bound
Pollution Attacks Detection in the P2PSP Live Streaming System
Weaver: A Multiagent, Spatial-Explicit and High-Performance Framework to Study Complex Ecological Networks
Extending a user access control proposal for wireless network services with hierarchical user credentials
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex
On Simplicial Longest Edge Bisection in Lipschitz Global Optimization
Data Parallelism in Traffic Control Tables with Arrival Information
A Parallel DISIMPL for Pile Placement Optimization in Grillage-Type Foundations
Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods
On a hybrid MPI-Pthread approach for simplicial branch-And-bound
On Computational Aspects of a Regular n-simplex Bisection
On Lower Bounds Using Additively Separable Terms in Interval B&B
Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst
On lower bounds using additively separable terms in interval B&B
Performance Driven Cooperation between Kernel and Auto-tuning Multi-threaded Interval B&B Applications
Lightweight user access control in energy-constrained wireless network services
Keeping Group Communications Private: An Up-to-Date Review on Centralized Secure Multicast
Adaptive parallel interval global optimization algorithms based on their performance for non-dedicated multicore architectures
A Key Distribution Scheme for Live Streaming Multi-tree Overlays
Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks
Reliable computation of roots to render real polynomials in complex space
Rendering (complex) algebraic surfaces
Reliable algorithms for ray intersection in computer graphics based on interval arithmetic
Packing equal circles in a square I. -: Problem setting and bounds for optimal solutions
Packing equal circles in a square II -: New results for up to 100 circles using the TAMSASS-PECS algorithm
Work load balance approaches for branch and bound algorithms on distributed systems
Informes y otros Todos / Ninguno
Erratum to Pareto optimality and robustness in bi-blending problems (TOP, 10.1007/s11750-012-0253-9)
Métricas del autor Todos / Ninguno
Indice H