Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Subviral Agents

Subviral Agents

Subviral agents are infectious entities that resemble viruses but lack one or more viral components, such as a capsid or essential replication machinery. These agents include viroids, prions, and satellites, each possessing distinct structural and functional characteristics that influence their mode of infection and replication.Viroids are the simplest subviral agents, consisting of circular, single-stranded RNA molecules without a protein coat. They exclusively infect plants, relying entirely...

Machines: Problem Solving II

Machines: Problem Solving II

Machines are complex structures consisting of movable, pin-connected multi-force members that work together to transmit forces. Consider a lifting tong carrying a 100 kg load. It comprises movable sections DAF and CBG linked together with member AB.

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Machines: Problem Solving I

Machines: Problem Solving I

A toggle clamp is a mechanical device commonly used for holding and clamping objects in various applications, such as woodworking, metalworking, and assembly operations. Consider a toggle clamp subjected to a force of 200 N at the handle. The vertical clamping force can be calculated, provided the dimensions of the toggle clamp are known.
The toggle clamp system is a machine structure consisting of movable, pin-connected multi-force members that form a stabilized system to transmit forces. The...

Encoding

Encoding

Information enters the brain through encoding, which is the input of information into the memory system. Once sensory information is received from the environment, the brain labels or codes it. The information is then organized with similar information and connected to existing concepts. Encoding occurs through automatic processing and effortful processing.
Automatic processing involves the encoding of details like time, space, frequency, and the meaning of words, usually done without conscious...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

A variable neighborhood Walksat-based algorithm for MAX-SAT problems.

TheScientificWorldJournal·2014

Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026

Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026

Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026

Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026

Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026

Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026

See all related articles

Search research articles

Related Experiment Video

Updated: May 22, 2026

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

A multilevel memetic algorithm for large SAT-encoded problems.

Noureddine Bouhmala¹

¹Department of Maritime Technology and Innovation, Vestfold University College, Norway. noureddine.bouhmala@hive.no

Evolutionary Computation

|May 1, 2012

Summary

This summary is machine-generated.

This study introduces a memetic algorithm using a multilevel paradigm to solve the Boolean satisfiability problem (SAT). The new approach improves performance on complex industrial hardware design instances.

More Related Videos

DeepOmicsAE: Representing Signaling Modules in Alzheimer's Disease with Deep Learning Analysis of Proteomics, Metabolomics, and Clinical Data

DeepOmicsAE: Representing Signaling Modules in Alzheimer's Disease with Deep Learning Analysis of Proteomics, Metabolomics, and Clinical Data

Published on: December 15, 2023

Related Experiment Videos

Last Updated: May 22, 2026

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

DeepOmicsAE: Representing Signaling Modules in Alzheimer's Disease with Deep Learning Analysis of Proteomics, Metabolomics, and Clinical Data

DeepOmicsAE: Representing Signaling Modules in Alzheimer's Disease with Deep Learning Analysis of Proteomics, Metabolomics, and Clinical Data

Published on: December 15, 2023

Area of Science:

Computer Science
Artificial Intelligence
Algorithm Design

Background:

The satisfiability problem (SAT) is a fundamental NP-complete problem with broad applications in artificial intelligence.
Finding satisfying assignments for Boolean expressions is computationally challenging, motivating research into efficient algorithms.

Purpose of the Study:

To introduce a novel memetic algorithm incorporating the multilevel paradigm for solving SAT.
To evaluate the effectiveness of this multilevel memetic algorithm compared to a standard memetic algorithm.

Main Methods:

Development of a memetic algorithm enhanced with a multilevel problem decomposition strategy.
Application of the algorithm to problem instances derived from real-world industrial hardware designs.
Comparative analysis of performance metrics between the multilevel and standard memetic algorithms.

Main Results:

The memetic algorithm utilizing the multilevel paradigm demonstrated improved performance.
The enhanced algorithm showed effectiveness in solving complex SAT instances from industrial hardware designs.
Performance gains were observed when comparing the multilevel approach against its non-multilevel counterpart.

Conclusions:

The multilevel paradigm is a beneficial enhancement for memetic algorithms applied to SAT.
This approach offers a promising direction for tackling complex Boolean satisfiability problems in practical applications.
The findings suggest potential for improved efficiency in AI and hardware design automation.