Search results
From MaRDI portal
- Type Multi-criteria optimization and decision-making in radiotherapy 2019-03-28 Paper A hybrid approach to beam angle optimization in intensity-modulated...10 bytes (18 words) - 22:50, 9 December 2023
- artificial bee colony algorithm for burdening optimization of copper strip production 2012-09-13 Paper Optimizing the rank position of the DMU as secondary...10 bytes (16 words) - 03:57, 7 October 2023
- zbMath Open burden.samuel-aMaRDI QIDQ2307560 No records found. This page was built for person: Samuel A. Burden...10 bytes (18 words) - 09:31, 6 October 2023
- Publication Date of Publication Type A New Faster Filter Based on Optimizing the Calculation Burden of Information and Kalman Filters 2022-11-29 Paper...10 bytes (16 words) - 21:36, 26 December 2023
- Publication Date of Publication Type A New Faster Filter Based on Optimizing the Calculation Burden of Information and Kalman Filters 2022-11-29 Paper...10 bytes (16 words) - 21:36, 26 December 2023
- systems with limited resource pooling 2016-06-20 Paper User Association to Optimize Flow Level Performance in Wireless Systems with Dynamic Interference 2009-12-09...10 bytes (18 words) - 23:33, 10 December 2023
- Improving performance of distributed detection networks: An entropy-based optimization 2002-03-03 Paper https://portal.mardi4nfdi.de/entity/Q4355683 1997-11-20...10 bytes (16 words) - 17:44, 6 October 2023
- Likelihood ratio and score burden tests for detecting disease-associated rare variants 2016-02-16 Paper A convex optimization approach to adaptive stabilization...10 bytes (17 words) - 20:41, 9 December 2023
- multivariate numerical data via principal component analysis 2021-02-04 Paper Optimized Query Forgery for Private Information Retrieval 2017-07-27 Paper A modification...10 bytes (16 words) - 02:03, 7 October 2023
- bundles 2008-07-11 Paper Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 2005-08-25 Paper...10 bytes (16 words) - 12:01, 6 October 2023
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems 2017-08-08 Paper On the stability of constrained MPC without...10 bytes (17 words) - 21:43, 11 December 2023
- in Subgraph Detection 2019-02-12 Paper Algorithms for separable convex optimization with linear ascending constraints 2018-12-04 Paper Learning to Detect...10 bytes (16 words) - 20:24, 6 October 2023
- TSP on the Line 2018-07-16 Paper A tight lower bound for online convex optimization with switching costs 2018-06-22 Paper https://portal.mardi4nfdi.de/entity/Q5351892...10 bytes (16 words) - 19:56, 24 September 2023
- artificial bee colony algorithm for burdening optimization of copper strip production 2012-09-13 Paper Optimizing the rank position of the DMU as secondary...10 bytes (15 words) - 12:42, 7 October 2023
- Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems 2017-08-08 Paper On the stability of constrained MPC without...10 bytes (19 words) - 21:43, 11 December 2023
- de/entity/Q5715672 2006-01-04 Paper Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 2005-08-25 Paper...10 bytes (16 words) - 12:01, 6 October 2023
- -Inventory System with Stationary Demand 2012-02-19 Paper An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process 2012-02-19...10 bytes (18 words) - 13:57, 24 September 2023
- mardi4nfdi.de/entity/Q4576243 2018-07-12 Paper Algorithms for multi-criteria optimization in possibilistic decision trees 2017-09-05 Paper Efficient policies for...10 bytes (18 words) - 02:37, 7 October 2023
- smoothing problem on simple assembly lines 2023-11-14 Paper E-platooning: optimizing platoon formation for long-haul transportation with electric commercial...10 bytes (16 words) - 19:07, 6 October 2023
- matrix for discrete‐time H2/H∞ static‐output‐feedback control: A two‐step optimization method 2019-01-17 Paper Robust \(H_\infty\) control of an observer-based...10 bytes (18 words) - 02:32, 10 December 2023
