Results 61 to 70 of about 161,341 (310)

Coalition structure generation over graphs [PDF]

open access: yes, 2012
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria   +5 more
core   +1 more source

An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem

open access: yes, 2021
This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into a variable neighborhood search for solving the permutation flow-shop scheduling problem. The algorithm first constructs a permutation as a
Mehrdad Amirghasemi
core   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

open access: yesInternational Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam   +2 more
wiley   +1 more source

Analysis and solutions to the stable roommate problem: An examination of complexity, stability, and matching algorithms

open access: yes, 2023
Roommate issues with strong preferences are defined here. An extension of the Stable Marriage Problem that does not include two partners is the Stable Roommates Problem, or SR. The complexity and approximability of the problem of computing an egalitarian stable matching in instances of d-SRI.
Humbal Zaidi   +2 more
openaire   +2 more sources

Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane   +3 more
wiley   +1 more source

Fifty years of scheduling: a survey of milestones [PDF]

open access: yes, 2009
Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A.   +5 more
core   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli   +3 more
wiley   +1 more source

Improving the Delay Performance of CSMA Algorithms: A Virtual Multi-Channel Approach [PDF]

open access: yes, 2013
CSMA algorithms have recently received a significant amount of interest in the literature for designing efficient wireless control algorithms. CSMA algorithms are attractive because they incur low computation complexity and communication overhead, and ...
Lin, Xiaojun, Huang, Po-Kai
core   +2 more sources

Multivariate Algorithmics for Finding Cohesive Subnetworks

open access: yesAlgorithms, 2016
Community detection is an important task in the analysis of biological, social or technical networks. We survey different models of cohesive graphs, commonly referred to as clique relaxations, that are used in the detection of network communities.
Christian Komusiewicz
doaj   +1 more source

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy