Results 51 to 60 of about 16,556 (177)
Современные информационные технологии и IT-образованиеThis article considers a computational method that is more efficient than methods based on the divide-and-conquer principle. Goethe once said that divide and conquer is a good principle, but the principle of unite and guide is better.
Rustem Aidagulov, Valery Vasenin
doaj +1 more source
, 2016 We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks that are amenable to the principle of divide and conquer, and study what are its implications in terms of ...
Alex Nowak, David Folqué, Joan Bruna
openaire +3 more sources
Upper Bounds for Possibly Negatives Divide-and-Conquer Sequences
, 2021 Divide-and-conquer is a popular strategy to design algorithms. It splits the input into several smaller subproblems, solving each subproblem separately, and then combine together to solve the original problem.
Guedj, Michael
core
Kombinasi Steganografi Berbasis Bit Matching dan Kriptografi DES untuk Pengamanan Data
Scientific Journal of Informatics, 2014 Pada penelitian ini dilakukan kombinasi steganografi dan kriptografi untuk pengamanan data dengan tidak mengubah kualitas media cover. Metode steganografi yang digunakan dengan melakukan pencocokan bit pesan pada bit MSB citra.
Budi Prasetiyo +2 more
doaj +1 more source
Rational Divide-and-Conquer Relations [PDF]
, 2011 A rational divide-and-conquer relation, which is a natural generalization of the classical divide-and-conquer relation, is a recursive equation of the form f(bn)=R(f(n),f(n),…,f(b−1)n)+g(n), where b is a positive integer ≥2; R a rational function in b ...
Charinthip Hengkrawit +2 more
core +1 more source
Annals of Medical Science and ResearchBackground: The most prevalent methods of nucleotomy for phacoemulsification of cataracts are divide-and-conquer and phaco chop. The current research aimed to assess and compare the endothelial cell loss (ECL) and distant visual acuity (DVA) following ...
Brajmohan Chaudhary +3 more
doaj +1 more source
Enhanced divide-and-conquer algorithm with 2-block policy [PDF]
, 2000 The number of comparisons involved in searching minimum and maximum elements from a set of data will determine the performance of an algorithm. A Divide-and-Conquer algorithm is the most efficient algorithm for searching minimum and maximum elements of a
master administrator
core +3 more sources
Niching-Driven Divide-and-Conquer Hill Exploration
Applied System InnovationOptimization problems often feature local optima with a significant difference in the basin of attraction (BoA), making evolutionary computation methods prone to discarding solutions located in less-attractive BoAs, thereby posing challenges to the ...
Junchen Wang, Changhe Li, Yiya Diao
doaj +1 more source
Divide and conquer approach to quantum Hamiltonian simulation
New Journal of Physics, 2018 We show a divide and conquer approach for simulating quantum mechanical systems on quantum computers. We can obtain fast simulation algorithms using Hamiltonian structure.
Stuart Hadfield, Anargyros Papageorgiou
doaj +1 more source
Pipelines for Divide-and-Conquer Functions [PDF]
The Computer Journal, 1993 Summary: Dynamic, parallel algorithms of the divide-and-conquer type are mapped onto static parallel computer architectures where the set of processors and their interconnections are fixed throughout the execution of a program. The approach taken is to transform a class of algorithms, expressed as functional programs, into a form that corresponds to a ...
Inman P. de Guzmán +2 more
openaire +2 more sources