Directed Graph
A graph where edges have a direction, representing relationships between nodes that can evolve over time.
Category: Concepts
Synaptic Q-learning
A reinforcement learning algorithm that updates action-value functions based on the Bellman equations at the synaptic level.
Bellman Memory Units (BMUs)
A neuromorphic architecture that integrates Bellman equations for reinforcement learning, enabling dynamic network topology evolution.
Interpretable Algorithm Design
The process of designing algorithms in a way that their workings and decisions can be easily understood.
Problem-Class Descriptors
Descriptors that characterize the properties of problem classes to aid in understanding algorithm behavior.
Closed Knowledge Loop
A feedback system where discovery, explanation, and generalization continuously inform and improve each other.
Metaheuristic
A high-level problem-solving framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms.
Explainable AI
A set of processes and methods that make the outputs of AI systems understandable to humans.
Flexible Job Shop Scheduling
A complex scheduling problem where jobs must be assigned to machines with varying capabilities and constraints to optimize performance metrics.
Adaptive Operator Evolution
A method that allows operators in Evolutionary Algorithms to evolve and adapt dynamically based on the performance and state of the population.