fairness (scheduling)

The property that a process blocked on in cannot be starved; required for the dining philosophers solution.

Neighborhood — ranked by edge-count

paper

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Scheduleconcept0.739
Schedule Conceptconcept0.718
Mechanical timer concept used throughout paper to illustrate operational principle and formal modeling of concepts
Both Equality Relations Algorithmconcept0.702
Algorithm computing both equality relations separately before comparing them in hierarchical equality task
Alignmentconcept0.700
The goal of making model behavior match human values and intentions, often addressed during post-training.
Political Equalityconcept0.695
Democratic principle entitling prolific digital minds constituting a supermajority to political control
Task balancingconcept0.693
The problem of ensuring all tasks in MTL perform well, avoiding dominance by some tasks.
Parallel Programmingconcept0.693
Euclidean Algorithmconcept0.686
Ancient algorithm from Euclid's Elements (circa 300 B.C.) that computes greatest common divisor; shown to structurally parallel Bjorklund's rhythm generation algorithm.