Results 111 to 120 of about 163,989 (311)
Advanced Materials, EarlyView.Intrinsic material dynamics are harnessed as computational resources for neuromorphic in‐materio physical reservoir computing. Defects, ionic motion, interfaces, percolation, geometry, and biasing shape transient states that provide fading memory, nonlinearity, and high‐dimensional projection for simple readout. A descriptor‐to‐dynamics framework links
Kshitij RB Singh +5 more
wiley +1 more source
Journal of Aerospace Technology and Management, 2013 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
Dealing with non-metric dissimilarities in fuzzy central clustering algorithms [PDF]
, 2008 Clustering is the problem of grouping objects on the basis of a similarity measure among them. Relational clustering methods can be employed when a feature-based representation of the objects is not available, and their description is given in terms of ...
Filippone, M., Maurizio Filippone
core +1 more source
Ionic Gating of Liquid‐Crystal‐Like Pteridine Assemblies Enables Tunable Light Scattering
Advanced Materials, EarlyView.Tunable optical properties emerge through developmentally regulated ionic gating, which transforms disordered, ultraviolet (UV)‐absorbing organelles into concentrically ordered, liquid‐crystal‐like light scatterers. By integrating analyses of pteridine composition, potassium‐dependent assembly, hierarchical ultrastructure, and optical behavior, the ...
Sourabh Bera +22 more
wiley +1 more source
Implementation and analysis of cutting stock problem algorithms. [PDF]
, 2007 A non – guillotinable, two – dimensional, rectangular cutting stock problem is being introduced in this paper and its solving methods either. Due to the combinatorial complexity of a problem, it is impossible to solve it optimally for every instance ...
Pokštas, Jonas,
core +1 more source
Informatika, 2019 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
Timetabling Problems and the Effort Toward Generic Algorithms: A Comprehensive Survey
IEEE AccessThe 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
EURASIP Journal on Wireless Communications and Networking, 2010 We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks.
Parastoo Sadeghi +2 more
doaj +1 more source
Selected Remarks about Computer Processing in Terms of Flow Control and Statistical Mechanics
Entropy, 2016 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
Average-Case Analysis of Algorithms Using Kolmogorov Complexity [PDF]
, 2000 Analyzing the average-case complexity of algorithms is a very practical but very difficult problem in computer science. In the past few years, we have demonstrated that Kolmogorov complexity is an important tool for analyzing the average-case ...
Vitányi, P.M.B. (Paul) +8 more
core +1 more source