Computational metric embeddings by Sidiropoulos, Anastasios

Get full text

Modelling of freight flows that consist of multiple products transported by different modes of transport in a multimodal network by A. Vasilis Vasiliauskas

“…The multiproduct aspect is estimated by the solution procedure which is a Gauss-Seidel-Linear Approximation Algorithm. The article is closely connected with the following topics: the representation of the network chosen for the reflection of transportation and transfer operations; the formulation of a multimode multiproduct model; the analysis of average and marginal cost functions; the development of the solution algorithm; the development of the algorithm used to compute the shortest path.…”
Get full text

Analysis of neural network results based on experimental data during indentation by Babushkina N, Lyapin A, Kovaleva A

“…According to the authors, the neural network approximation algorithm is able to take into account the behavior of materials in various experimental conditions. …”
Get full text

Examining the correlation between the weather conditions and COVID-19 pandemic in India: A mathematical evidence by Manash Jyoti Borah, Bipan Hazarika, Sumati Kumari Panda, Juan Jose Nieto

“…In this article, for the analysis of Covid-19 progression in India, we present new insights to formulate a data-driven epidemic model and approximation algorithm using the real data on infection, recovery and death cases with respect to weather in the view of mathematical variables.…”
Get full text

Belief Propagation Algorithm for Portfolio Optimization Problems. by Takashi Shinzato, Muneki Yasuda

“…In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. …”
Get full text

Self-guided quantum state tomography for limited resources by Syed Tihaam Ahmad, Ahmad Farooq, Hyundong Shin

“…We propose a faster convergent simultaneous perturbation stochastic approximation algorithm which is more practical in a resource-deprived situation for determining the underlying quantum states by incorporating the Barzilai–Borwein two-point step size gradient method with minimal loss of accuracy.…”
Get full text

An optimization method of LNT aftertreatment system based on discrete approximation by Mitsuru TOYODA, Tielong SHEN

“…Then, the optimal control problem is formulated as a nonlinear dynamics-constrained optimization problem with a cost function that targets the NOx reduction with trade-off between fuel consumption and emission reduction. A numerical approximation algorithm is proposed to solve the optimization problem. …”
Get full text

Joint Coflow Optimization for Data Center Networks by Zhaoxi Wu

“…This paper proposes a joint online scheduling framework, which first develops a 2-approximation algorithm to reduce the CCT of a single coflow, and then follows the Shortest Remaining Time First (SRTF) principle to schedule multiple coflows. …”
Get full text

Perishables Liner Bunkering Strategy and Route Optimization Considering Carbon Tax and Sulfur Emissions by Liu Cuilian, Zhao Weige

“…For the issue of perishable goods liner shipping route selection and bunkering strategy, this paper gives full consideration to the characteristics of perishable goods, in the context of the carbon tax and the setting of emission control zones, constructs a mixed-integer nonlinear planning model with the goal of minimizing the total weekly cost of liner service, designs a segmented linear approximation algorithm for model solution, and conducts an arithmetic analysis based on the actual liner voyage as an example, which provides a reference for the actual operation of shipping.…”
Get full text

Unbalanced multi-drawing urn with random addition matrix by Aguech Rafik, Selmi Olfa

“…Using a stochastic approximation algorithm and martingales methods, we investigate the asymptotic behavior of the urn after many draws.…”
Get full text

Approximating the minimum cycle mean by Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer

“…Our contributions are twofold: (1) First we show that the algorithmic question is reducible in O(n^2) time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1 + ε)-approximation algorithm for the problem and the running time of our algorithm is ilde(O)(n^ω log^3(nW/ε) / ε), where O(n^ω) is the time required for the classic n-by-n matrix multiplication and W is the maximum value of the weights.…”
Get full text

Diffusing information for mobile social networks under consideration of dynamic influence by Dong Jing, Ting Liu

“…Theoretical analysis shows that the influence maximization problem under new model is non-deterministic polynomial-time hard, and efficient approximation algorithm is proposed. Experimental studies on real data sets show that the new model can process dynamic influence well in the diffusing information procedure, and the proposed algorithms can solve the influence maximization problem on new model efficiently.…”
Get full text

A Theoretical and Practical Approach to Instruction Scheduling on Spatial Architectures by Mirrokni, Vahab S., Lee, Walter, Karger, David, Amarasinghe, Saman

“…We also present an 8-approximation algorithm for constant m and constant communication delays. …”
Get full text

Automatic shaping and decomposition of reward functions by Marthi, Bhaskara

“…We then give a function approximation algorithm forsolving both problems together. …”
Get full text

Approximation-tolerant model-based compressive sensing by Hegde, Chinmay, Indyk, Piotr, Schmidt, Ludwig

“…Interestingly, our extension requires the existence of approximation algorithms for both the maximization and the minimization variants of the optimization problem. …”
Get full text
Get full text
Get full text

Algorithmic and game-theoretic perspectives on scheduling by Uhan, Nelson A. (Nelson Alexander)

Get full text

Mining weakly labeled web facial images for search-based face annotation by Wang, Dayong, He, Ying, Zhu, Jianke, Hoi, Steven C. H.

“…To further speed up the proposed scheme, we also propose a clustering-based approximation algorithm which can improve the scalability considerably. …”
Get full text
Get full text

Look-Ahead Algorithm with Whole S-Curve Acceleration and Deceleration by Youdong Chen, Xudong Ji, Yong Tao, Hongxing Wei

“…In addition, the look-ahead algorithms with S-curve acc/dec are too complex to adopt the equivalent S-curve profile by approximation algorithm. To increase the smoothness of feedrate profile and machining efficiency of continuous short line and circle machining, this paper presents a feedrate profile generation approach and corresponding look-ahead algorithm with whole S-curve acc/dec. …”
Get full text

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning by David Spies, Jia-Huai You, Ryan Hayward

“…As computing a minimum multiclique covering from a mutex graph is NP-hard, we propose an efficient approximation algorithm for multiclique covering and show experimentally that it generates substantially smaller grounding size for mutex constraints in ASP than the previously known work in SAT.…”
Get full text

Constructing Battery-Aware Virtual Backbones in Wireless Sensor Networks by Chi Ma, Yuanyuan Yang, Zhenghao Zhang

“…Then we show that finding a MBACDS is NP-hard and give a distributed approximation algorithm to construct the BACDS. The resulting BACDS constructed by our algorithm is at most (8+Δ)opt size, where Δ is the maximum node degree and opt is the size of an optimal BACDS. …”
Get full text