A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

“…To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. A Newton-based algorithm is also adopted for solving the nonlinear systems resulting from the considered monolithic approach. …”
Get full text

Approximation algorithms inspired by kernelization nethods by Abu-Khzam, Faisal N.

“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text

Data Embedding in HEVC Video by Modifying the Partitioning of Coding Units by Shanableh, Tamer

Subjects: Get full text

Public health utility of cause of death data: applying empirical algorithms to improve data quality by Sarah Charlotte Johnson (9715415)

Data reductions and combinatorial bounds for improved approximation algorithms by Abu-Khzam, Faisal N.

“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text

Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks by Abu-Khzam, Faisal N.

“…We present a first distributed approximation algorithm for this problem. The algorithm achieves a constant approximation ratio if the ratio of the maximum transmission range over the minimum transmission range in the network is bounded and takes O(Diam) rounds, where Diam is the diameter of the graph. …”
Get full text
Get full text
Get full text
Get full text

Sample intelligence-based progressive hedging algorithms for the stochastic capacitated reliable facility location problem by Nezir Aydin (8355378)

“…Two commonly used SP methods are approximation methods, i.e., Sample Average Approximation (SAA), and decomposition methods, i.e., Progressive Hedging Algorithm (PHA). …”

New Fast Arctangent Approximation Algorithm for Generic Real-Time Embedded Applications by Mohieddine Benammar (18103039)

“…The contributions of this work are summarized as follows: (1) introducing a new approximation algorithm with high precision and application-based flexibility; (2) introducing a new rational approximation formula that outperforms literature alternatives with the algorithm at higher accuracy requirement; and (3) presenting a practical evaluation index for rational approximations in the literature.…”

Development of an Optimization Algorithm for Internet Data Traffic by Misbahuddin, Syed

“…The algorithm monitors data repetitions in IP datagram and prepares a compression code in response of this repetition. …”
Get full text

Efficient Approximate Conformance Checking Using Trie Data Structures by Awad, Ahmed

“…In this paper, we contribute a new formulation of the proxy behavior derived from a model for approximate conformance checking. By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …”
Get full text
Get full text
Get full text

Approximate XML structure validation based on document–grammar tree similarity by Tekli, Joe

“…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…”
Get full text
Get full text
Get full text
Get full text

A Fast and Robust Gas Recognition Algorithm Based on Hybrid Convolutional and Recurrent Neural Network by Xiaofang Pan (1895950)

On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

Subjects:

Practical single node failure recovery using fractional repetition codes in data centers by Itani, May

“…FR codes consist of a concatenation of an outer maximum distance separable (MDS) code and an inner fractional repetition code that splits the data into several blocks and stores multiple replicas of each on different nodes in the system. …”
Get full text
Get full text
Get full text
Get full text

Mixed precision iterative refinement with adaptive precision sparse approximate inverse preconditioning by Noaman Khan (19810050)

“…In this work, we develop an adaptive precision sparse approximate inverse preconditioner and demonstrate its use within a five-precision GMRES-based iterative refinement method. …”

Large language models for code completion: A systematic literature review by Rasha Ahmad Husein (19744756)

Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

Get full text
Get full text
Get full text
Get full text

Belief selection in point-based planning algorithms for POMDPs by Azar, Danielle

“…Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value function can be derived by interpolation from the values of a specially selected set of points. …”
Get full text
Get full text
Get full text
Get full text

A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

Get full text
Get full text

UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data by Behrouz Ahadzadeh (19757022)

“…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …”