The following pages link to Leocadio G. Casado (Q925233):
Displaying 32 items.
- (Q241473) (redirect page) (← links)
- A suite of algorithms for key distribution and authentication in centralized secure multicast environments (Q415239) (← links)
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks (Q455943) (← links)
- Pareto optimality and robustness in bi-blending problems (Q458955) (← links)
- Erratum to: ``Pareto optimality and robustness in bi-blending problems'' (Q458980) (← links)
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686) (← links)
- On determining the cover of a simplex by spheres centered at its vertices (Q645552) (← links)
- New approaches to circle packing in a square. With program codes. (Q855072) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (Q1577439) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU (Q1683325) (← links)
- A new multisection technique in interval methods for global optimization (Q1840763) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- New interval methods for constrained global optimization (Q2490338) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- (Q3165325) (← links)
- (Q4353373) (← links)
- (Q4530412) (← links)
- (Q4530413) (← links)
- (Q4639655) (← links)
- (Q4640245) (← links)
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions (Q4785926) (← links)
- On derivative based bounding for simplicial branch and bound (Q5001436) (← links)
- A heuristic rejection criterion in interval global optimization algorithms (Q5960908) (← links)
- On refinement of the unit simplex using regular simplices (Q5964244) (← links)
