Results 241 to 250 of about 2,748,769 (296)

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

Advanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch, Maximilian Holland, Klaus Drechsler, Johannes Schilp   +3 more
wiley   +1 more source

A model predictive control-based energy management strategy for grid-connected nanogrids. [PDF]

Sci Rep
Selmy M, Abdulnabi A, Ali AA, Saied EM, Elsayed WT.   +4 more
europepmc   +1 more source

Police emergency dispatch model based on emergency level analysis and traffic planning. [PDF]

PLoS One
Qiao S, Xu P.
europepmc   +1 more source

Integrated machine learning forecasting and grey wolf optimization for optimal operation of virtual power plants in smart distribution networks. [PDF]

Sci Rep
El Hamid AMA, Elzohri HH, Sayed K.
europepmc   +1 more source

Integrated design for rural microgrids in Egypt incorporating hydrogen energy and vehicle-to-grid technology. [PDF]

Sci Rep
Sayed MS, Alham MH, Ibrahim DK.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Optimized appointment scheduling

European Journal of Operational Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Kemper, Chris A. J. Klaassen, Michel Mandjes   +2 more
openaire   +5 more sources

On the optimality of linear schedules

Journal of VLSI signal processing systems for signal, image and video technology, 1989
An algorithm can be modeled as a set of indexed computations, and a schedule is a mapping of the algorithm index space into time.Linear schedules are a special class of schedules that are described by a linear mapping and are commonly used in many systolic algorithms.Free schedules cause computations of an algorithm to execute as soon as their operands
Weijia Shang, José A. B. Fortes
openaire   +1 more source

On optimal scheduling in DEDS

[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The local optimality (LO) property for discrete event dynamic systems (DEDS) modeled using Petri nets (PNs) is presented. If a system is divided into independent subsystems and if the optimal behavior of these subsystems guarantees the optimal behavior of the whole system, then this system possesses the LO property.
Antonio Ramírez-Treviño, Javier Campos, Manuel Silva Suárez   +2 more
openaire   +2 more sources

On strictly optimal schedules for the cumulative cost-optimal scheduling problem

Computing, 1980
Given a set ofn events (or jobs) which are constrained by a precedence relation, we want to order them into a totally ordered sequence (i. e., one machine schedule). Each event has an integer cost (which may be negative) associated with it, and our objective is to minimize the maximum cumulative cost within a schedule, i.
Hussein M. Abdel-Wahab, Tiko Kameda
openaire   +2 more sources

Asymptotically Optimal Appointment Schedules

Mathematics of Operations Research, 2019
We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows to minimize the sum of customer waiting time and server overtime costs. Because appointments need to be scheduled ahead of time, we refer to this problem as an optimization problem rather than a dynamic control one. We study
Mor Armony, Rami Atar, Harsha Honnappa
openaire   +3 more sources