The following pages link to Inmaculada F. García (Q1577438):
Displayed 48 items.
- Item:Q1577438 (redirect page) (← links)
- Item:Q1577438 (redirect page) (← 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)
- Sensitivity analysis of a continuous multifacility competitive location and design problem (Q845577) (← links)
- New approaches to circle packing in a square. With program codes. (Q855072) (← links)
- Parallel quadrant interlocking factorization on hypercube computers (Q919737) (← 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)
- A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
- Heuristic rejection in interval global optimization (Q1407232) (← links)
- Three-dimensional reconstruction of cellular structures by electron microscope tomography and parallel computing. (Q1427465) (← links)
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions (Q1577439) (← links)
- A new multisection technique in interval methods for global optimization (Q1840763) (← links)
- On success rates for controlled random search (Q1850825) (← links)
- Wage flexibility: evidence from five EU countries based on the wage curve. (Q1853648) (← links)
- Biological structure determination by EM is well suited to grid computing (Q1882722) (← links)
- On endmember identification in hyperspectral images without pure pixels: a comparison of algorithms (Q1932910) (← links)
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane (Q2268924) (← links)
- A population global optimization algorithm to solve the image alignment problem in electron crystallography (Q2385491) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- On the minimum volume simplex enclosure problem for estimating a linear mixing model (Q2392121) (← links)
- A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand (Q2392125) (← links)
- On interval branch-and-bound for additively separable functions with common variables (Q2392130) (← links)
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
- Parallelization of reconstruction algorithms in three-dimensional electron microscopy (Q2504456) (← links)
- On the Efficiency and Effectiveness of Controlled Random Search (Q2999082) (← links)
- (Q3150790) (← links)
- (Q3150791) (← links)
- Parallel algorithms for continuous competitive location problems (Q3605201) (← links)
- (Q4353373) (← links)
- (Q4414763) (← links)
- (Q4414775) (← links)
- (Q4530410) (← links)
- (Q4530412) (← links)
- (Q4530413) (← links)
- (Q4639655) (← links)
- Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions (Q4785926) (← links)
- Progressive Image Transmission in Telemicroscopy: A Quantitative Approach for Electron Microscopy Images of Biological Specimens (Q4798274) (← links)
- (Q5688515) (← links)
- High Performance Computing for Computational Science - VECPAR 2004 (Q5705997) (← links)
- High Performance Computing for Computational Science - VECPAR 2004 (Q5705999) (← links)
- Reliability and performance of UEGO, a clustering-based global optimizer (Q5940043) (← links)
- UEGO, an abstract clustering technique for multimodal global optimization (Q5944362) (← links)
- A heuristic rejection criterion in interval global optimization algorithms (Q5960908) (← links)
- On refinement of the unit simplex using regular simplices (Q5964244) (← links)