Results 121 to 130 of about 149,618 (314)
http://dx.doi.org/10.5028/jatm.v5i4.252 The nonlinear unscented Kalman filter (UKF) is evaluated for the satellite orbit determination problem, using Global Positioning System (GPS) measurements. The assessment is based on the robustness of the filter.
Paula C. P. M. Pardal +2 more
doaj
Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics
Despite the fact that much has been said about processing in computer science, it seems that there is still much to do. A classical approach assumes that the computations done by computers are a kind of mathematical operation (calculations of functions ...
Dominik Strzałka
doaj +1 more source
Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
The problem of finding local extrema on halftone images is considered. Well-known block-search algorithms provide high speed, but they extract only strict (single-pixel) extremes, skipping extreme areas formed by non-strict extremes. Morphological search
V. Yu. Tsviatkou, Anh Tuan Nguyen
doaj
This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source
Limited Randomness in Games, and Computational Perspectives in Revealed Preference [PDF]
In this dissertation, we explore two particular themes in connection with the study of games and general economic interactions: bounded resources and rationality.
Kalyanaraman, Shankar
core +1 more source
The knapsack problem is an optimization problem in computer science which involves determining the most valuable combination of items that can be packed into a knapsack (a container) with a limited capacity (weight or volume); the goal is to maximize the total profit of the items included in the knapsack without exceeding its capacity.
Bin Usman, Bashar Bin +4 more
openaire +2 more sources
Optoelectronic synaptic devices based on solution‐processed molecular telluride GST‐225 phase‐change inks are demonstrated for three‐factor learning. A global optical signal broadcast through a silicon waveguide induces non‐volatile conductance updates exclusively in locally electrically flagged memristors.
Kevin Portner +14 more
wiley +1 more source
The bi-objective travelling salesman problem with profits and its connection to computer networks. [PDF]
This is an interdisciplinary work in Computer Science and Operational Research. As it is well known, these two very important research fields are strictly connected. Among other aspects, one of the main areas where this interplay is strongly evident is
Stevanato, Elisa
core
Timetabling Problems and the Effort Toward Generic Algorithms: A Comprehensive Survey
The timetabling problem, a well-known NP-Hard optimization challenge, spans multiple domains such as education, healthcare, sports, and transportation.
I. Gusti Agung Premananda +2 more
doaj +1 more source

