Results 21 to 30 of about 609,661 (311)
Partitioning Search Spaces of a Randomized Search [PDF]
Fundamenta Informaticae, 2009 This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what is the best way to use the computers to solve the instance? Two approaches, simple distribution and search space partitioning as well as their combinations are investigated both
Niemelä Ilkka +2 more
openaire +3 more sources
Minimum weight design of truss structure via force method and Jaya algorithm” [PDF]
مهندسی مکانیک شریف, 2021 This research aims to minimize the weight of truss structures using force method formulation as a structural analyzer and Jaya algorithm as an optimizer tool.
A. Barzegari +2 more
doaj +1 more source
Plant Disease Detection Using Deep Convolutional Neural Network
Applied Sciences, 2022 In this research, we proposed a novel 14-layered deep convolutional neural network (14-DCNN) to detect plant leaf diseases using leaf images. A new dataset was created using various open datasets.
J. Arun Pandian +5 more
doaj +1 more source
Optimizing Persistent Random Searches [PDF]
Physical Review Letters, 2012 4 pages, 4 ...
Tejedor, Vincent +2 more
openaire +3 more sources
Generalization of navigation memory in honeybees
Frontiers in Behavioral Neuroscience, 2023 Flying insects like the honeybee learn multiple features of the environment for efficient navigation. Here we introduce a novel paradigm in the natural habitat, and ask whether the memory of such features is generalized to novel test conditions. Foraging
Eric Bullinger +2 more
doaj +1 more source
Agent-Based Collaborative Random Search for Hyperparameter Tuning and Global Function Optimization
Systems, 2023 Hyperparameter optimization is one of the most tedious yet crucial steps in training machine learning models. There are numerous methods for this vital model-building stage, ranging from domain-specific manual tuning guidelines suggested by the oracles ...
Ahmad Esmaeili +2 more
doaj +1 more source
Diffusion–Advection Equations on a Comb: Resetting and Random Search
Mathematics, 2021 This review addresses issues of various drift–diffusion and inhomogeneous advection problems with and without resetting on comblike structures. Both a Brownian diffusion search with drift and an inhomogeneous advection search on the comb structures are ...
Trifce Sandev +3 more
doaj +1 more source
Journal of Applied Informatics and Computing, 2023 Classification is one of the important tasks in the field of Machine Learning. Classification can be viewed as an Optimization Problem (Optimization Problem) with the aim of finding the best model that can represent the relationship/pattern between data ...
Muhamad Fajri, Aji Primajaya
doaj +1 more source
Machine Learning and Knowledge Extraction, 2023 In an era characterised by rapid technological advancement, the application of algorithmic approaches to address complex problems has become crucial across various disciplines.
Samuel Corecco +2 more
doaj +1 more source
Random Backtracking in Backtrack Search Algorithms for Satisfiability [PDF]
, 2007 This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms.
Marques-Silva, J. +3 more
core +1 more source