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...

Local and global symmetry breaking in itemset mining

Annals of mathematics and artificial intelligence, 2017-05, Vol.80 (1), p.91-112

Benhamou, Belaïd

2017

Volltextzugriff (PDF)

An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks

Electronic proceedings in theoretical computer science, 2019, Vol.306 (Proc. ICLP 2019), p.295-301

2019

Volltextzugriff (PDF)

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT

Intelligent decision technologies, 2019-01, Vol.13 (2), p.193-210

2019

Volltextzugriff (PDF)

Breakout variable neighbourhood search for the minimum interference frequency assignment problem

Journal of systems and information technology, 2018-11, Vol.20 (4), p.468-488

2018

Volltextzugriff (PDF)

A memetic algorithm for the optimal winner determination problem

Soft computing (Berlin, Germany), 2009-07, Vol.13 (8-9), p.905-917

2009

Volltextzugriff (PDF)

An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints

Procedia computer science, 2018, Vol.126, p.1395-1404

2018

Volltextzugriff (PDF)

Artificial Intelligence, Automated Reasoning, and Symbolic Computation: Joint International Conferences, AISC 2002 and Calculemus 2002 Marseille, France, July 1-5, 2002 Proceedings

1, 2002

Volltextzugriff (PDF)

An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance

2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), 2019, p.3799-3804

2019

Volltextzugriff (PDF)

Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human Operators

2023 IEEE International Conference on Networking, Sensing and Control (ICNSC), 2023, Vol.1, p.1-6

2023

Volltextzugriff (PDF)

Dealing with Satisfiability and n-ary CSPs in a Logical Framework

Journal of automated reasoning, 2012-03, Vol.48 (3), p.391-417

2012

Volltextzugriff (PDF)

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding

Theoretical computer science, 2023-09, Vol.971, p.114073, Article 114073

2023

Volltextzugriff (PDF)

Dealing with Biology Systems in the Framework of Answer Set Programming

Procedia computer science, 2020, Vol.176, p.450-459

2020

Volltextzugriff (PDF)

A synergy Thompson sampling hyper‐heuristic for the feature selection problem

Computational intelligence, 2022-06, Vol.38 (3), p.1083-1105

2022

Volltextzugriff (PDF)

Evolutionary Iterated Local Search meta‐heuristic for the antenna positioning problem in cellular networks

Computational intelligence, 2022-06, Vol.38 (3), p.1183-1214

2022

Volltextzugriff (PDF)

A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints

Applied soft computing, 2017-10, Vol.59, p.556-573

2017

Volltextzugriff (PDF)

Trap spaces of multi-valued networks: definition, computation, and applications

Bioinformatics (Oxford, England), 2023-06, Vol.39 (Supplement_1), p.i513-i522

2023

Volltextzugriff (PDF)

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells

Annals of mathematics and artificial intelligence, 2023-10, Vol.91 (5), p.713-750

2023

Volltextzugriff (PDF)

Exact and Meta-heuristic Approaches for the Single-machine Scheduling Problem with Flexible Maintenance under Human Resource Constraints

International journal of manufacturing research, 2022, Vol.17 (1), p.1

2022

Volltextzugriff (PDF)

A Boolean Encoding Including SAT and n-ary CSPs

Artificial Intelligence: Methodology, Systems, and Applications, 2006, p.33-44

2006

Volltextzugriff (PDF)

Reasoning by Dominance in Not-Equals Binary Constraint Networks

Lecture notes in computer science, 2006, p.670-674

2006

Volltextzugriff (PDF)

Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks

International journal of applied metaheuristic computing, 2019-07, Vol.10 (3), p.134-150

2019

Volltextzugriff (PDF)

Predicting and Detecting Symmetries in FOL Finite Model Search

Journal of automated reasoning, 2006-04, Vol.36 (3), p.177-212

2006

Volltextzugriff (PDF)

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints

International journal of manufacturing research, 2022, Vol.17 (1), p.22

2022

Volltextzugriff (PDF)

A New Method for Computing Stable Models in Logic Programming

2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018, p.800-807

2018

Volltextzugriff (PDF)

A multilevel hyper-heuristic for solving Max-SAT

International Journal of Metaheuristics, 2017, Vol.6 (3), p.133

2017

Volltextzugriff (PDF)

1 – 25 von 94

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(41)
Mit Volltextzugriff
(82)

Publikationsform

Sprache

Englisch
(94)

Erscheinungsjahr

n.n

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Local and global symmetry breaking in itemset mining

An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks

A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT

Breakout variable neighbourhood search for the minimum interference frequency assignment problem

A memetic algorithm for the optimal winner determination problem

An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints

Artificial Intelligence, Automated Reasoning, and Symbolic Computation: Joint International Conferences, AISC 2002 and Calculemus 2002 Marseille, France, July 1-5, 2002 Proceedings

An Integrated Guided Local Search considering Human Resource Constraints for the Single-machine Scheduling problem with Preventive Maintenance

Bi-objective Resolution of the Single-machine Scheduling Problem with Availability and Human Operators

Dealing with Satisfiability and n-ary CSPs in a Logical Framework

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding

Dealing with Biology Systems in the Framework of Answer Set Programming

A synergy Thompson sampling hyper‐heuristic for the feature selection problem

Evolutionary Iterated Local Search meta‐heuristic for the antenna positioning problem in cellular networks

A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints

Trap spaces of multi-valued networks: definition, computation, and applications

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells

Exact and Meta-heuristic Approaches for the Single-machine Scheduling Problem with Flexible Maintenance under Human Resource Constraints

A Boolean Encoding Including SAT and n-ary CSPs

Reasoning by Dominance in Not-Equals Binary Constraint Networks

Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks

Predicting and Detecting Symmetries in FOL Finite Model Search

Exact and metaheuristic approaches for the single-machine scheduling problem with flexible maintenance under human resource constraints

A New Method for Computing Stable Models in Logic Programming

A multilevel hyper-heuristic for solving Max-SAT

Suchergebnisse filtern