Výsledky vyhľadávania - "algorithms and complexity"

Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems Autor Tadayon, Bita, Smith, J. Cole

“… We assume that job processing times are subject to uncertainty. Accordingly, we construct three alternative uncertainty sets, each of which defines job processing times that can simultaneously occur…”
Získať plný text

Algorithms and complexity results for finding graphs with extremal Randić index Autor Kincaid, Rex K., Kunkler, Sarah J., Lamar, Michael Drew, Phillips, David J.

“… Approximating the minimum weight perfect b‐matching problem subject to a connectivity constraint is shown to be NP‐hard…”
Získať plný text

Combinatorial Problems in Algorithms and Complexity Theory Autor Potukuchi, Aditya

“… Indeed, many problems in this subject are often very combinatorial in nature. These problems have either used existing techniques from combinatorics or have given rise to new combinatorial techniques…”
Získať plný text

Factors influencing the acceptance and usage of ChatGPT as an emerging learning tool among higher education students in Bangladesh: a structural equation modeling Autor Howlader, Md. Hasan, Tohan, Mortuja Mahamud, Zaman, Sayeeda, Chanda, Sanjoy Kumar, Jiaxin, Guo, Rahman, Md. Ashfikur

“… Nevertheless, its impact on Bangladeshi university students remains a subject of debate. This cross-sectional study examines ChatGPT usage among Bangladeshi university students and its determinants using the Technology Acceptance Model (TAM…”
Získať plný text

Advances and Novel Approaches in Discrete Optimization

“…’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process…”
Získať plný text

A generalized evolutionary metaheuristic (GEM) algorithm for engineering optimization Autor Yang, Xin-She

“…Many optimization problems in engineering and industrial design applications can be formulated as optimization problems with highly nonlinear objectives, subject to multiple complex constraints…”
Získať plný text

An ad hoc distributed systems approach for industrial wireless sensor network management Autor Gholami, M., Taboun, M.S., Brennan, R.W.

“… This approach is tested using a large-scale (400–676 node) agent-based simulation of a factory environment that is subject to noise and blockage…”
Získať plný text

Deterministic Production Planning: Algorithms and Complexity Autor Florian, M, Lenstra, J. K, Rinnooy Kan, A. H. G

“… For each period, production and storage cost functions are specified. The production costs may include set-up costs and the production levels may he subject to capacity limits…”
Získať plný text

Algorithms and complexity analysis for integer multicommodity network flow and robust single-machine scheduling problems Autor Tadayon, Bita

“…In this dissertation we address several optimization problems with uncertain data elements. For each problem we apply an appropriate method for uncertainty…”
Získať plný text

Competitions as a stimulating and evaluation method on algorithms and complexity course

“… In this paper we present our experience in the organization of laboratory exercises of the Algorithms and complexity faculty courses in the form of competitions…”
Získať plný text

Algorithms and Complexity Results for Exact Bayesian Structure Learning Autor Ordyniak, Sebastian, Szeider, Stefan

“…Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we…”
Získať plný text

Boolean Matching Reversible Circuits: Algorithm and Complexity Autor Tian-Fu, Chen, Jiang, Jie-Hong R

“… input/output negation and permutation conditions subject to the availability/unavailability…”
Získať plný text

Theoretical Computer Science and Discrete Mathematics

“… The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms…”
Získať plný text

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras Autor Kleest-Meißner, Sarah, Marasus, Jonas, Niewerth, Matthias

“…). We provide an exemplary application of the framework to the problem of efficiently enumerating answers to MSO-definable queries over trees which are subject to local updates…”
Získať plný text

Surviving rate of graphs and Firefighter Problem Autor Wang, Weifan, Kong Jiangxu

“…, including algorithms and complexity, Firefighter Problem for special graphs (finite and infinite) and digraphs, surviving rate and burning number of graphs. We also collect some open problems and possible research subjects…”
Získať plný text

Algorithm and Complexity for a Network Assortativity Measure Autor Kunkler, Sarah J, M Drew LaMar, Kincaid, Rex K, Phillips, David

“… However, the realization found via this reduction is not guaranteed to be connected. Approximating the minimum weight b-matching problem subject to a connectivity constraint is shown to be NP-Hard…”
Získať plný text

Algorithms for Circuits and Circuits for Algorithms Autor Williams, Ryan

“…The title of this paper is meant to highlight an emerging duality between two fundamental topics in algorithms and complexity theory…”
Získať plný text

Algorithmic Techniques for Variant Selection in Genome Graphs Autor Tavakoli, Neda

“… This dissertation research takes a holistic approach to develop a novel mathematical framework for variant selection in genome graphs subject to preserving sequences of length α with at most δ differences…”
Získať plný text

Bioinformatics algorithms: techniques and applications Autor Măndoiu, Ion, Zelikovsky, Alexander

“…Presents algorithmic techniques for solving problems in bioinformatics, including applications that shed new light on molecular biology This book introduces…”
Získať plný text

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras Autor Kleest-Meißner, Sarah, Marasus, Jonas, Niewerth, Matthias

“…). We provide an exemplary application of the framework to the problem of efficiently enumerating answers to MSO-definable queries over trees which are subject to local updates…”
Získať plný text