Results 71 to 80 of about 4,855,672 (239)
International Journal of Engineering Business Management, 2019 Today in developing countries, perilous chemicals are widely used that have harmful effect on human resources. National and global organizations developed different approaches to control chemicals exposure and their consequences in that one of them is ...
Mahdi Maleki
doaj +1 more source
The Journal of Engineering, 2023 Travelling salesman problem (TSP) is one of the most famous problems in graph theory, as well as one of the typical nondeterministic polynomial time (NP)‐hard problems in combinatorial optimization. Reinforcement learning (RL) has been widely regarded as
Jiaying Wang +3 more
doaj +1 more source
An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis [PDF]
, 2012 This paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better ...
Fabian, Martin +2 more
core +2 more sources
New Technology, Work and Employment, EarlyView.ABSTRACT Algorithmic management (AM) is regarded as a crucial advancement in current workplaces. AM has the potential to alter job tasks and reorganize entire work processes, thus affecting the working conditions of employees. Nonetheless, research on the possible consequences for workplace relationships remains limited.
Mareike Reimann, Martin Diewald
wiley +1 more source
Microservice combination optimisation based on improved gray wolf algorithm
Connection Science, 2023 Microservices architecture is a new paradigm for application development. The problem of optimising the performance of microservice architectures from a non-functional perspective is a typical Nondeterministic Polynomial (NP) problem.
Jingjing Hu +5 more
doaj +1 more source
An Exact Algorithm for the Hazardous Orienteering Problem
Networks, Volume 86, Issue 2, Page 105-111, September 2025.ABSTRACT The hazardous orienteering problem is the topic of this study. It is a variant of the well‐studied orienteering problem, where a vehicle, given a maximum mission time, has to select and visit customers out of a set of requests, aiming at maximizing the total profit associated with the customers selected. In the hazardous version of the problem
Roberto Montemanni, Derek H. Smith
wiley +1 more source
Reachability in Higher-Order-Counters
, 2013 Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +1 more source
AI in Neurology: Everything, Everywhere, All at Once Part 1: Principles and Practice
Annals of Neurology, Volume 98, Issue 2, Page 211-230, August 2025.Artificial intelligence (AI) is rapidly transforming healthcare, yet it often remains opaque to clinicians, scientists, and patients alike. This review, part 1 of a 3‐part series, provides neurologists and neuroscientists with a foundational understanding of AI's key concepts, terminology, and applications.
Matthew Rizzo, Jeffrey D. Dawson
wiley +1 more source
ETRI Journal, 2022 This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of batterypowered mobile devices.
Zhigang Xie +3 more
doaj +1 more source
Epistemic virtues, metavirtues, and computational complexity [PDF]
, 2003 I argue that considerations about computational complexity show that all finite agents need characteristics like those that have been called epistemic virtues.
Morton, Professor Adam
core