UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem

Theoretical computer science, 2020-09, Vol.832, p.20-41

2020

Volltextzugriff (PDF)

A fixed-parameter algorithm for the vertex cover P3 problem

Information processing letters, 2015-02, Vol.115 (2), p.96-99

Tu, Jianhua

2015

Volltextzugriff (PDF)

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

Applied soft computing, 2022-03, Vol.118, p.108554, Article 108554

2022

Volltextzugriff (PDF)

The resilience of conjunctive queries with inequalities

Information sciences, 2022-10, Vol.613, p.982-1002

2022

Volltextzugriff (PDF)

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs

Theoretical Computer Science, 2014, p.13-26

2014

Volltextzugriff (PDF)

Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach

Mathematical Foundations of Computer Science 2011, 2011, p.520-531

2011

Volltextzugriff (PDF)

ILSGVCP: An improved local search algorithm for generalized vertex cover problem

The Journal of the Operational Research Society, 2023-11, Vol.ahead-of-print (ahead-of-print), p.1-9

2023

Volltextzugriff (PDF)

NuMWVC: A novel local search for minimum weighted vertex cover problem

The Journal of the Operational Research Society, 2020-09, Vol.71 (9), p.1498-1509

2020

Volltextzugriff (PDF)

Complexity and algorithms for the connected vertex cover problem in 4-regular graphs

Applied mathematics and computation, 2017-05, Vol.301, p.107-114

2017

Volltextzugriff (PDF)

Finding near-optimal independent sets at scale

Journal of heuristics, 2017-08, Vol.23 (4), p.207-229

2017

Volltextzugriff (PDF)

A new approach for solving the minimum vertex cover problem using artificial bee colony algorithm

Decision analytics journal, 2023-03, Vol.6, p.100175, Article 100175

Banharnsakun, Anan

2023

Volltextzugriff (PDF)

Component-cardinality-constrained critical node problem in graphs

Discrete Applied Mathematics, 2016-09, Vol.210, p.150-163

2016

Volltextzugriff (PDF)

An Interactive Application for Learning and Analyzing Different Graph Vertex Cover Algorithms

International Journal of Engineering Pedagogy, 2023-01, Vol.13 (1), p.4-19

2023

Volltextzugriff (PDF)

An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

Applied soft computing, 2011-12, Vol.11 (8), p.5360-5366

2011

Volltextzugriff (PDF)

Vertex Cover Optimization Using a Novel Graph Decomposition Approach

Computers, materials & continua, 2022, Vol.73 (1), p.701-717

2022

Volltextzugriff (PDF)

Fixed set search applied to the multi-objective minimum weighted vertex cover problem

Journal of heuristics, 2022-08, Vol.28 (4), p.481-508

2022

Volltextzugriff (PDF)

A population-based iterated greedy algorithm for the minimum weight vertex cover problem

Applied soft computing, 2012-06, Vol.12 (6), p.1632-1639

2012

Volltextzugriff (PDF)

A hybrid algorithm based on modified chemical reaction optimization and best-first search algorithm for solving minimum vertex cover problem

Neural computing & applications, 2022-09, Vol.34 (18), p.15513-15541

2022

Volltextzugriff (PDF)

A Survey on the k-Path Vertex Cover Problem

Axioms, 2022-05, Vol.11 (5), p.191

Tu, Jianhua

2022

Volltextzugriff (PDF)

Efficient algorithm for the vertex cover Pk problem on cacti

Applied mathematics and computation, 2017-10, Vol.311, p.217-222

Tu, Jianhua

2017

Volltextzugriff (PDF)

Formulation of Mindfulness States as a Network Optimization Problem and an Attempt to Identify Key Brain Pathways Using Digital Annealer

IEICE Transactions on Information and Systems, 2022/11/01, Vol.E105.D(11), pp.1969-1983

2022

Volltextzugriff (PDF)

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization

Parallel Problem Solving from Nature - PPSN XV, 2018, Vol.11101, p.134-145

2018

Volltextzugriff (PDF)

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

Algorithmica, 2021-04, Vol.83 (4), p.906-939

2021

Volltextzugriff (PDF)

Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm

Quantum information processing, 2023-07, Vol.22 (7), Article 271

2023

Volltextzugriff (PDF)

Multi-objective evolutionary computation for topology coverage assessment problem

Knowledge-based systems, 2019-08, Vol.177, p.1-10

2019

Volltextzugriff (PDF)

1 – 25 von 477

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(368)
Mit Volltextzugriff
(451)

Publikationsform

Sprache

Englisch
(477)
Japanisch
(2)

Erscheinungsjahr

n.n

Thema

Science & Technology
(332)
Vertex Cover
(311)
Technology
(305)
Computer Science
(290)
Computer Science, Theory & Methods
(186)
Mathematics
(132)
Physical Sciences
(124)
Mathematics, Applied
(99)
Algorithms
(96)
Exact Sciences And Technology
(93)
Applied Sciences
(91)
Vertex Cover Problem
(85)
Computer Science; Control Theory; Systems
(73)
Theoretical Computing
(65)
Computer Science, Software Engineering
(63)
Approximation Algorithm
(58)
Computer Science, Artificial Intelligence
(51)
Optimization
(51)
Algorithmics. Computability. Computer Arithmetics
(48)
Graph Theory
(47)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 30 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem

A fixed-parameter algorithm for the vertex cover P3 problem

Applying the quantum approximate optimization algorithm to the minimum vertex cover problem

The resilience of conjunctive queries with inequalities

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs

Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach

ILSGVCP: An improved local search algorithm for generalized vertex cover problem

NuMWVC: A novel local search for minimum weighted vertex cover problem

Complexity and algorithms for the connected vertex cover problem in 4-regular graphs

Finding near-optimal independent sets at scale

A new approach for solving the minimum vertex cover problem using artificial bee colony algorithm

Component-cardinality-constrained critical node problem in graphs

An Interactive Application for Learning and Analyzing Different Graph Vertex Cover Algorithms

An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

Vertex Cover Optimization Using a Novel Graph Decomposition Approach

Fixed set search applied to the multi-objective minimum weighted vertex cover problem

A population-based iterated greedy algorithm for the minimum weight vertex cover problem

A hybrid algorithm based on modified chemical reaction optimization and best-first search algorithm for solving minimum vertex cover problem

A Survey on the k-Path Vertex Cover Problem

Efficient algorithm for the vertex cover Pk problem on cacti

Formulation of Mindfulness States as a Network Optimization Problem and an Attempt to Identify Key Brain Pathways Using Digital Annealer

Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm

Multi-objective evolutionary computation for topology coverage assessment problem

Suchergebnisse filtern