Výsledky vyhledávání - Fully polynomial time approximation algorithm

A fully polynomial time approximation scheme for a stop schedule of a transportation line without branches.

Autoři: Jeong, In-Jae¹ (AUTHOR) ijeong@hanyang.ac.kr

Zdroj: Engineering Optimization. May2025, Vol. 57 Issue 5, p1323-1342. 20p.

Témata: *POLYNOMIAL approximation, *POLYNOMIAL time algorithms, *HEURISTIC algorithms, *CUSTOMER satisfaction, *TRANSPORTATION schedules

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

Autoři: Ye, Yinyu

Zdroj: Mathematics of Operations Research, 1993 May 01. 18(2), 334-345.

Přístupová URL adresa: https://www.jstor.org/stable/3690284

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Autoři: Halman, Nir Klabjan, Diego Mostagir, Mohamed a další

Zdroj: Mathematics of Operations Research, 2009 Aug 01. 34(3), 674-685.

Přístupová URL adresa: https://www.jstor.org/stable/40538438

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

Autoři: Karger, David R.

Zdroj: SIAM Review, 2001 Sep 01. 43(3), 499-522.

Přístupová URL adresa: https://www.jstor.org/stable/3649796

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem: A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem

Autoři: YeYinyu

Zdroj: Mathematics of Operations Research. 18:334-345

Témata: polynomal-time algorithm, potential reduction algorithm, Computational methods for problems pertaining to operations research and mathematical programming, polynomial-time approximation scheme, 0211 other engineering and technologies, 02 engineering and technology, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), linear complementarity, \(\varepsilon\)-approximate stationary point

Popis souboru: application/xml

Přístupová URL adresa: https://dl.acm.org/doi/10.5555/2773155.2773162

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing

Autoři: Caprara, Alberto Lodi, Andrea Monaci, Michele

Zdroj: Mathematics of Operations Research, 2005 Feb 01. 30(1), 150-172.

Přístupová URL adresa: https://www.jstor.org/stable/25151644

Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness.

Autoři: Nguyen, Trung Thanh Elbassioni, Khaled Luong, Nguyen Cong a další

Zdroj: IEEE Transactions on Vehicular Technology. May2022, Vol. 71 Issue 5, p5128-5142. 15p.

Témata: *TELECOMMUNICATION systems, POLYNOMIAL time algorithms, APPROXIMATION algorithms, HEURISTIC algorithms, FAIRNESS

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates.

Autoři: Kacem, Imed Kellerer, Hans

Zdroj: Journal of Scheduling; Jun2011, Vol. 14 Issue 3, p257-265, 9p

Témata: APPROXIMATION algorithms, FIRST in, first out (Accounting), TECHNICAL specifications, POLYNOMIALS, MACHINERY

A FULLY POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR COMPUTING A STATIONARY POINT OF THE GENERAL LINEAR COMPLEMENTARITY PROBLEM.

Autoři: Yinyu Ye

Zdroj: Mathematics of Operations Research; May93, Vol. 18 Issue 2, p334-345, 12p

Témata: ALGORITHMS, LINEAR complementarity problem, ALGEBRA, APPROXIMATION theory, POLYNOMIALS, MATHEMATICAL programming, MATHEMATICS

Vector scheduling with rejection on two machines.

Autoři: Dai, Bingfei Li, Weidong

Zdroj: International Journal of Computer Mathematics. Dec2020, Vol. 97 Issue 12, p2507-2515. 9p.

Témata: Online algorithms, Approximation algorithms, Polynomial approximation, Polynomial time algorithms, Dynamic programming, Production scheduling, Scheduling

Exact and Approximation Algorithms for Optimal Equipment Selection in Deploying In-Building Distributed Antenna Systems

Autoři: Adjiashvili, David Bosio, Sandro Li, Yuan a další

Zdroj: IEEE Transactions on Mobile Computing. 14(4):702-713

Témata: Wireless communication, combinatorial algorithms, trees

Popis souboru: electronic

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-117649
https://liu.diva-portal.org/smash/get/diva2:811557/FULLTEXT01.pdf

Approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a fixed job and release dates

Autoři: Kacem, Imed Kellerer, Hans KACEM, Imed

Přispěvatelé: Kacem, Imed Kellerer, Hans KACEM, Imed

Zdroj: 2009 International Conference on Computers & Industrial Engineering. :291-295

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences

Přístupová URL adresa: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005223876
https://ieeexplore.ieee.org/document/5223876/

Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem.

Autoři: Dai, Junyan Rubel, Tobias Han, Yunheng a další

Zdroj: Algorithms for Molecular Biology; 1/8/2024, Vol. 19 Issue 1, p1-17, 17p

Témata: PARSIMONIOUS models, DYNAMIC programming, ALGORITHMS, HEURISTIC

Parameterized complexity and polynomial-time approximation schemes

Autoři: Huang, Xiuzhen

Thesis Advisors: Chen, Jianer

Témata: complexity theory, lower bound, NP-hard problems, approximation, polynomial-time approximation schemes

Popis souboru: 582142 bytes; electronic; application/pdf; born digital

Dostupnost: http://hdl.handle.net/1969.1/1446

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Autoři: Kacem, Imed Kellerer, Hans KACEM, Imed

Přispěvatelé: Kacem, Imed Kellerer, Hans KACEM, Imed

Zdroj: Journal of Scheduling. 14:257-265

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences

Přístupová URL adresa: https://hal.science/hal-04001041v1
https://doi.org/10.1007/s10951-009-0146-4

Using Supervised Machine Learning Algorithms to Predict Bovine Leukemia Virus Seropositivity in Florida Beef Cattle: A 10‐Year Retrospective Study.

Autoři: Megahed, Ameer A. Bommineni, Y. Reddy Short, Michael a další

Zdroj: Journal of Veterinary Internal Medicine. May2025, Vol. 39 Issue 3, p1-12. 12p.

Wave propagation problems with aeroacoustic applications

Autoři: Espinoza Román, Héctor Gabriel

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Escola Tècnica Superior d'Enginyers de Camins, Canals i Ports de Barcelona

Thesis Advisors: Codina Rovira, Ramon, Badia, Santiago

Zdroj: TDX (Tesis Doctorals en Xarxa)

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/299533
https://dx.doi.org/10.5821/dissertation-2117-95709

New results for non-preemptive speed scaling

Autoři: Huang, Chien-Chung Ott, S.

Zdroj: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8635 LNCS(PART 2):360-371

Témata: Processing speed, Laminar families, Algorithms, Polynomial-time algorithm, Constant factor approximation, Total energy consumption, Fully polynomial time approximation schemes, Approximation scheme, Strongly NP-hard, Approximation theory

Přístupová URL adresa: https://research.chalmers.se/publication/216598

Weighted ASTRID: fast and accurate species trees from weighted internode distances.

Autoři: Liu, Baqiao Warnow, Tandy

Zdroj: Algorithms for Molecular Biology; 7/19/2023, Vol. 18 Issue 1, p1-22, 22p

Témata: HORIZONTAL gene transfer, POLYNOMIAL time algorithms, NUMBERS of species, CHROMOSOME duplication

An Approximation Algorithm for Scheduling on Heterogeneous Reconfigurable Resources.

Autoři: NAHAPETIAN, ANI BRISK, PHILIP GHIASI, SOHEIL a další

Zdroj: ACM Transactions on Embedded Computing Systems; Oct2009, Vol. 9 Issue 1, p5-5:20, 20p, 5 Diagrams, 1 Chart, 4 Graphs

Témata: ALGORITHMS, COMPUTER scheduling, ADAPTIVE computing systems, FIELD programmable gate arrays, DATA transmission systems, MULTIPROCESSORS, SENSOR networks, LINEAR programming