Suchergebnisse - Fixed-parameterized algorithm*

Fixed parameterized algorithms for generalized feedback vertex set problems

Autoren: Bin Sheng Gregory Gutin

Quelle: Theoretical Computer Science. 953:113798

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem.

Autoren: Baguley, Samuel Friedrich, Tobias Neumann, Aneta et al.

Quelle: Algorithmica. Apr2025, Vol. 87 Issue 4, p537-571. 35p.

Schlagwörter: *LINEAR programming, *ALGORITHMS, *MATHEMATICS, *GENERALIZATION, *EVOLUTIONARY algorithms

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP

Autoren: Mehrdad Moharrami Yashaswini Murthy Arghyadip Roy et al.

Quelle: Mathematics of Operations Research. 50:431-458

Schlagwörter: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, FOS: Electrical engineering, electronic engineering, information engineering, Systems and Control (eess.SY), 02 engineering and technology, 0101 mathematics, Electrical Engineering and Systems Science - Systems and Control, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2202.04157

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times.

Autoren: Shabtay, Dvir Mor, Baruch

Quelle: Journal of Scheduling; Jun2024, Vol. 27 Issue 3, p239-256, 18p

Schlagwörter: FLOW shop scheduling, APPROXIMATION algorithms, FLOW shops, POLYNOMIAL approximation, POLYNOMIAL time algorithms

Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity

Autoren: Gargano L. Rescigno A. A.

Quelle: Lecture Notes in Computer Science ISBN: 9783031327322

Schlagwörter: Fixed parameterized algorithms, Neighborhood diversity, Spanning tree

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP.

Autoren: Moharrami, Mehrdad Murthy, Yashaswini Roy, Arghyadip et al.

Quelle: Mathematics of Operations Research; Feb2025, Vol. 50 Issue 1, p431-458, 28p

Schlagwörter: APPROXIMATION theory, STOCHASTIC approximation, REINFORCEMENT learning, MARKOV processes, COMPUTER networks

Parameterized Algorithm for 3-SAT

Autoren: Gao, Yi

Quelle: Theses and Dissertations - UTB/UTPA

Schlagwörter: Applied sciences, 3-SAT, Fixed parameterized algorithm, NP-complete, Computer Sciences

Dateibeschreibung: application/pdf

Relation: https://scholarworks.utrgv.edu/leg_etd/558; https://scholarworks.utrgv.edu/context/leg_etd/article/1457/viewcontent/GAO_utpa.edu_6240N_10073.pdf

Verfügbarkeit: https://scholarworks.utrgv.edu/leg_etd/558
https://scholarworks.utrgv.edu/context/leg_etd/article/1457/viewcontent/GAO_utpa.edu_6240N_10073.pdf

Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem.

Autoren: Shabtay, Dvir Gerstl, Enrique

Quelle: European Journal of Operational Research. Aug2024, Vol. 316 Issue 3, p887-898. 12p.

Schlagwörter: *FLOW shop scheduling, *LINEAR programming, APPROXIMATION algorithms, POLYNOMIAL time algorithms, POLYNOMIAL approximation

Greedy gradient-free adaptive variational quantum algorithms on a noisy intermediate scale quantum computer.

Autoren: Feniou, César Hassan, Muhammad Claudon, Baptiste et al.

Quelle: Scientific Reports; 5/28/2025, Vol. 15 Issue 1, p1-18, 18p

Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem

Autoren: Samuel Baguley Tobias Friedrich Aneta Neumann et al.

Quelle: Proceedings of the Genetic and Evolutionary Computation Conference. :1537-1545

Schlagwörter: FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2303.11281

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP

Autoren: Moharrami, Mehrdad Murthy, Yashaswini Roy, Arghyadip et al.

Index Begriffe: Electrical Engineering and Systems Science - Systems and Control, text

URL: http://arxiv.org/abs/2202.04157

Polynomial and FPT algorithms for Chinese Postman, packing and acyclicity

Autoren: Sheng, Bin

Schlagwörter: 005.1, Parameterized Complexity, Chinese Postman Problem, Kernelization, Linear Kernel, Edge Colored Graphs, Polynomial Time Algorithm, Acyclicity, Packing Problem

Zugangs-URL: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792670

Parameterized complexity of categorical clustering with size constraints.

Autoren: Fomin, Fedor V. Golovach, Petr A. Purohit, Nidhi

Quelle: Journal of Computer & System Sciences. Sep2023, Vol. 136, p171-194. 24p.

Schlagwörter: *INTEGERS, *CLUSTER algebras, *PERCOLATION theory, *MATRICES (Mathematics)

The [formula omitted]-labeling problem: An algorithmic tour.

Autoren: Fertin, Guillaume Rusu, Irena Vialette, Stéphane

Quelle: Discrete Applied Mathematics. Sep2018, Vol. 246, p49-61. 13p.

Schlagwörter: *GRAPH theory, *ALGORITHMS, *GRAPHIC methods, *MATHEMATICAL optimization, *MATHEMATICAL bounds

Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique.

Autoren: Paul, Christophe Perez, Anthony Thomassé, Stéphan

Quelle: Journal of Computer & System Sciences. Mar2016, Vol. 82 Issue 2, p366-379. 14p.

Schlagwörter: *POLYNOMIALS, *ALGORITHMS, *KERNEL functions, *PROBLEM solving, *FEATURE extraction

FPT-ALGORITHMS FOR THE ℓ-MATCHOID PROBLEM WITH A COVERAGE OBJECTIVE.

Autoren: CHIEN-CHUNG HUAN WARD, JUSTIN

Quelle: SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 2, p1053-1078, 26p

Schlagwörter: SUBMODULAR functions, DETERMINISTIC algorithms, MATROIDS, ALGORITHMS

Algorithms and Complexities of Matching Variants in Covariate Balancing.

Autoren: Hochbaum, Dorit S. Levin, Asaf Rao, Xu

Quelle: Operations Research; Sep/Oct2023, Vol. 71 Issue 5, p1800-1814, 15p

Schlagwörter: POLYNOMIAL time algorithms, ALGORITHMS, NP-hard problems

Firma/Körperschaft: NATIONAL Science Foundation (U.S.)

Prefix and suffix reversals on strings.

Autoren: Fertin, Guillaume Jankowiak, Loïc Jean, Géraldine

Quelle: Discrete Applied Mathematics. Sep2018, Vol. 246, p140-153. 14p.

Schlagwörter: *STRING, *PERMUTATIONS, *ALGORITHMS, *PARAMETERS (Statistics), *MATHEMATICAL analysis

Performance analysis of evolutionary algorithm for the maximum internal spanning tree problem.

Autoren: Xia, Xiaoyun Huang, Zhengxin Peng, Xue et al.

Quelle: Journal of Supercomputing; Jun2022, Vol. 78 Issue 9, p11949-11973, 25p

Schlagwörter: ALGORITHMS, SPANNING trees, EVOLUTIONARY algorithms, UNDIRECTED graphs, COMBINATORIAL optimization, NP-hard problems, SEARCH algorithms

Sugarcane crop line detection from UAV images using genetic algorithm and Radon transform.

Autoren: Silva, Renato Rodrigues da Escarpinati, Mauricio Cunha Backes, André Ricardo

Quelle: Signal, Image & Video Processing; Nov2021, Vol. 15 Issue 8, p1723-1730, 8p