Results 61 to 70 of about 43,512 (302)
On k-greedy routing algorithms
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huaming Zhang, Xiang-Zhi Kong
openaire +2 more sources
Fast greedy triangulation algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Dickerson +3 more
openaire +1 more source
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will output the unique worst possible solution.
Francois Margot (3885187) +3 more
core +1 more source
What Do Large Language Models Know About Materials?
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer +2 more
wiley +1 more source
The Feature Compression Algorithms for Identifying Cytokines Based on CNT Features
As the signaling proteins, cytokines regulate a wide range of biological functions. It is important to distinguish the cytokines from other kinds of proteins.
Guilin Li, Xing Gao
doaj +1 more source
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing
Xue Han +7 more
doaj +1 more source
The classification of greedy algorithms
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A better algorithm for random k-SAT [PDF]
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high probability for constraint densities m/n < (1 − εk)2k ln(k)/k, where εk → 0 ...
Coja-Oghlan, Amin, Amin Coja-Oghlan
core +1 more source
This work develops polyacrylamide‐alginate (PAM‐Alg) double‐network hydrogel fibers for multimodal perception and intelligent human‐machine interfaces. The covalent‐ionic network provides high strength, toughness, and stable conductivity. Easily woven into wearables and integrated with soft robots, the fibers enable object and temperature recognitions ...
Yujue Yang +10 more
wiley +1 more source
An Improved Q-Learning Algorithm and Its Application in Path Planning
Traditional Q-Learning algorithm has the problems of too many random searches and slow convergence speed. Therefore, in this paper an improved ε-Q-Learning algorithm based on traditional Q-Learning algorithm was propased and applied to path planning. The
Guojun MAO, Shimin GU
doaj +1 more source

