Results 41 to 50 of about 163,989 (311)
A Fast Neural Network Learning Algorithm with Approximate Singular Value Decomposition
The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms.
Jankowski Norbert, Linowiecki Rafał
doaj +1 more source
Direct Aperture Optimization for Intensity Modulated Radiation Therapy: Two Calibrated Metaheuristics and Liver Cancer Case Study [PDF]
Integrated treatment planning for cancer patients has high importance in intensity modulated radiation therapy (IMRT). Direct aperture optimization (DAO) is one of the prominent approaches used in recent years to attain this goal.
Ali Fallahi +2 more
doaj
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. [PDF]
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings.
Fernando Soler-Toscano +3 more
doaj +1 more source
Coalition structure generation over graphs [PDF]
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria +5 more
core +1 more source
The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem.
Marcelo da Silva Reis +2 more
openaire +3 more sources
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms [PDF]
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard AlgorithmsThe paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given.
openaire +2 more sources
Lithuanian Olympiads in Informatics are being organized since 1990. Each Olympiad consists of three rounds. The final (national) one is divided into two parts, there are also elder and younger divisions. Each year there are supplied a lot of tasks. The paper deals with algorithmic problems of all the Lithuanian olympiads of school students and all the ...
Valentina Dagienė, Jūratė Skūpienė
openaire +2 more sources
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
METHODS OF SOLVING THE PATTERN RECOGNITION PROBLEM USING RESIDUE NUMBER SYSTEM
The paper proposes a possibility of implementing algorithms of solving the pattern recognition problem in the Residue Number System. Considered the most advanced information processing algorithms in the Residue Number System and performed their ...
Nikolay Ivanovich Chervyakov +2 more
doaj
The increasing number and functional complexity of power electronics in more electric aircraft (MEA) power systems have led to a high degree of complexity in modelling and computation, making real-time energy management a formidable challenge, and the ...
Bing Liu +4 more
doaj +1 more source

