Results 101 to 110 of about 148,724 (314)

An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels

open access: yesEURASIP Journal on Wireless Communications and Networking, 2010
We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks.
Parastoo Sadeghi   +2 more
doaj   +2 more sources

Evaluation of Algorithms for Identification of Minimal Cut Vectors and Minimal Path Vectors in Multi-State Systems

open access: yesCommunications, 2015
Minimal Cut Vectors (MCVs) and Minimal Path Vectors (MPVs) are one of the key concepts of reliability analysis. They allow us to estimate system availability or to analyze influence of individual system components on the entire system.
Miroslav Kvassay, Jozef Kostolny
doaj   +1 more source

Evaluation of Plasticity and Creep Parameters From Tensile Stress–Strain Data for a Range of Strain Rates

open access: yesAdvanced Engineering Materials, EarlyView.
This plot compares experimental tensile stress–strain curves (with 4 different strain rates) and corresponding modelled curves (obtained using the optimised sets of Voce and Miller–Norton parameter values shown). The inferred M‐N values, characterizing the creep, are very similar to those obtained via conventional creep testing.
S. Ooi, R. P. Thompson, T. W. Clyne
wiley   +1 more source

Fast and Accurate Direct Position Estimation Using Low-Complexity Correlation and Swarm Intelligence Optimization

open access: yesRemote Sensing
Direct Position Estimation (DPE) is an alternative GNSS positioning method that models received satellite signals as a function of the receiver’s navigation state, allowing for the direct estimation of position, velocity, and time within the navigation ...
Yuze Duan   +4 more
doaj   +1 more source

On the Use of Biased-Randomized Algorithms for Solving Non-Smooth Optimization Problems

open access: yes, 2019
Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Albert Ferrer   +4 more
core   +1 more source

An Experimental High‐Throughput Approach for the Screening of Hard Magnet Materials

open access: yesAdvanced Engineering Materials, EarlyView.
An entire workflow for the high‐throughput characterization and analysis of compositionally graded magnetic films is presented. Characterization protocols, data management tools and data analysis approaches are illustrated with test case Sm(Fe, V)12 based films.
William Rigaut   +16 more
wiley   +1 more source

The computational complexity of rationalizing Pareto optimal choice behavior. [PDF]

open access: yes
We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability.
Demuynck, Thomas
core   +2 more sources

Optimal entanglement distribution within a multi-ring topology

open access: yesScientific Reports
Entanglement distribution networks are essential for enabling secure, reliable, and sustained communication through the future Quantum Internet. Multi-ring network topologies offer improved scalability and redundancy, but also introduce additional ...
B. C. Ciobanu   +4 more
doaj   +1 more source

Numerical evidence for phase transitions of NP-complete problems for instances drawn from Lévy-stable distributions

open access: yes, 2011
Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability.
Connelly, Abram, Abram Connelly
core  

FPT algorithms for diverse collections of hitting sets [PDF]

open access: yes, 2019
In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of parameterized complexity.
Jaffke, Lars   +9 more
core   +1 more source

Home - About - Disclaimer - Privacy