On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound |
|
Local search versus linear programming to detect monotonicity 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 <i>A case study on a smartphone and Chromecast using peer-to-peer technology to skip third-party servers</i> |
|
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 <i>n</i>-Simplex |
|
Erratum to: Pareto optimality and robustness in bi-blending problems |
|
Pareto optimality and robustness in bi-blending problems |
|
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 |
|