Suchergebnisse - random pseudo-polynomial algorithm

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions von Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

“… \). In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability …”
Volltext

Stochastic binary problems with simple penalties for capacity constraints violations von Fortz, B., Labbé, M., Louveaux, F., Poss, M.

“… We provide pseudo-polynomial algorithms for three special cases of the problem: constant weights and capacity uniformly distributed, subset sum with Gaussian weights …”
Volltext

On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness von Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

“… , we obtain a pseudo-polynomial algorithm using discounts …”
Volltext

Computation of the random arrival rule for bankruptcy problems von Aziz, Haris

“… is #P-complete to compute. The general complexity result is complemented by a pseudo-polynomial-time dynamic programming algorithm for the random arrival rule …”
Volltext

The loader problem: formulation, complexity and algorithms von Tang, G, Chen, F, Cheng, T C E, Ng, C T, Chen, Z-L

“… practical situations, and propose polynomial and pseudo-polynomial time algorithms for solving these cases …”
Volltext

A convex programming-based algorithm for mean payoff stochastic games with perfect information von Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Makino, Kazuhisa

“… . In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability …”
Volltext

Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem von Becker, Henrique, Araujo, Olinto, Buriol, Luciana S.

“… We employ a state-of-the-art Mixed-Integer Linear Programming (MILP) formulation of the literature, and our enhanced version of it, to solve a classical …”
Volltext

Efficient computation of evacuation routes on a three-dimensional geometric network von Tang, Huajun, Elalouf, Amir, Levner, Eugene, Cheng, T.C.E.

“… •We prove the problem to be NP-hard.•We suggest the exact dynamic programming algorithm and two polynomial time approximation algorithms …”
Volltext

Robust optimization approach for a chance-constrained binary knapsack problem von Han, Jinil, Lee, Kyungsik, Lee, Chungmok, Choi, Ki-Seok, Park, Sungsoo

“… items. For this problem we propose an efficient pseudo-polynomial time algorithm based on the robust optimization approach for finding a solution with a theoretical bound on the probability of satisfying …”
Volltext

A randomized CPA-secure asymmetric-key chaotic color image encryption scheme based on the Chebyshev mappings and one-time pad von Ali Shakiba

“… This key establishment algorithm is used to generate three chaotic pseudo-random number sequences to permute the rows and the columns of the plain image randomly …”
Volltext

Maximum Box Problem on Stochastic Points von Caraballo, Luis E., Pérez-Lantero, Pablo, Seara, Carlos, Ventura, Inmaculada

“… We show that even in d = 1 these computations are #P-hard, and give pseudo-polynomial …”
Volltext

NPRACH-Aware Link Adaptation and Uplink Resource Allocation in NB-IoT Cellular Networks von Yu, Ya-Ju, Wang, Jhih-Kai

“… However, because narrowband physical random access channels (NPRACHs) will occupy the partial uplink radio resource, the uplink transmission of a device using …”
Volltext

Discrete Optimal Transport with Independent Marginals is #P-Hard von Taşkesen, Bahar, Shafieezadeh-Abadeh, Soroosh, Kuhn, Daniel, Natarajan, Karthik

“… We study the computational complexity of the optimal transport problem that evaluates the Wasserstein distance between the distributions of two K-dimensional discrete random vectors …”
Volltext

Algorithms for robust production scheduling with energy consumption limits von Módos, István, Šůcha, Přemysl, Hanzálek, Zdeněk

“… •B&B algorithm with release-date-based branching rule for small-scale problems.•DDE algorithm with multi-point insertion scheme for moderate-scale problems …”
Volltext

Digital-Twin-Enabled 6G Mobile Network Video Streaming Using Mobile Crowdsourcing von Qi, Lianyong, Xu, Xiaolong, Wu, Xiaotong, Ni, Qiang, Yuan, Yuan, Zhang, Xuyun

“… ) communication paradigm is an attractive technique to alleviate the problem. However, the previous research work on D2D built on individuals' random mobility or position snapshot and cannot guarantee the stable communication flow …”
Volltext

Lifting for the integer knapsack cover polyhedron von Chen, Wei-Kun, Chen, Liang, Dai, Yu-Hong

“… ) inequality under certain conditions. We show that the problem of computing the coefficients for an SL inequality is N P -hard but can be solved by a pseudo-polynomial time algorithm …”
Volltext

A fully polynomial time approximation scheme for the probability maximizing shortest path problem von Lee, Jisun, Joung, Seulgi, Lee, Kyungsik

“… •Algorithms for the probability maximizing shortest path problem are proposed.•Pseudo polynomially or polynomially solvable special cases are identified …”
Volltext

A single-item lot-sizing problem with a by-product and inventory capacities von Suzanne, Elodie, Absi, Nabil, Borodin, Valeria, van den Heuvel, Wilco

“… •A pseudo-polynomial dynamic programming (DP) algorithm is proposed for ULS-B.•For ULS-B with constant inventory capacities, a polynomial DP algorithm is developed …”
Volltext

Iterated local search for single machine total weighted tardiness batch scheduling von Queiroga, Eduardo, Pinheiro, Rian G. S., Christ, Quentin, Subramanian, Anand, Pessoa, Artur A.

“… them. Moreover, we compare the performance of our algorithm with dynamic programming-based implementations for the problem, including one from the literature and two other ones inspired in biased random …”
Volltext

Service Reliability in an HC: Considering From the Perspective of Scheduling With Load-Dependent Machine Reliability von Liu, Chubo, Li, Kenli, Liang, Jie, Li, Keqin

“… Considering the fact that a server is more likely to fail if it is highly loaded, in this paper, we involve load impacts on service reliability in a …”
Volltext