294 skills · sorted by relevance
Expert-level algorithms and complexity theory covering sorting, searching, graph algorithms, dynamic programming, greedy algorithms, NP-completeness, and algorithm design paradigms.
The English summary is being prepared. Showing the original description.
Specify algorithms for Model-Based Design: system specs, architecture specs, implementation plans, test plans. Use when creating specifications for controllers, signal processing, diagnostics, estimators, or other algorithms authored in Simulink, Stateflow, System Composer, or MATLAB Function blocks.
The English summary is being prepared. Showing the original description.
Think and work like an expert Algorithms Researcher. Use when a task calls for Algorithms Researcher judgment. Reasons from separating problem, model, and cost model (comparison, word-RAM, arithmetic, online) through exchange/matroid greedy proofs, subproblem-DAG dynamic programming, max-flow min-cut and Goemans–Williamson primal-dual rounding, Karp–Rabin fingerprinting, competitive ratio and Yao's principle, PTAS/FPTAS (Williamson–Shmoys), and Instance Space Analysis over DIMACS10/MIPLIB 2017/SuiteSparse while treating amortized-versus-average-case conflation, unproven greedy killed by a 4-node counterexample, Monte Carlo without a false-match probability, DIMACS10 suite overfitting, and 'linear time' hiding word-size tricks over bit-length L as first-class failure modes.
The English summary is being prepared. Showing the original description.
Run Neo4j Graph Analytics algorithms (PageRank, Louvain, WCC, Dijkstra, KNN, Node2Vec, FastRP, GraphSAGE) directly inside Snowflake without moving data. Use when running graph algorithms against Snowflake tables via the Neo4j Snowflake Native App ("GDS Snowflake", "graph algorithms in Snowflake", "Neo4j Graph Analytics"). Covers the explore → prepare projection views → project-compute-write flow, the strict view/column type rules the graph engine requires, exact SQL CALL syntax, and privilege setup in both modes — app-identity grants and execute-as-user / per-user PAT auth (programmatic access token, set_enable_custom_credentials, register_user_role, caller grants). Does NOT cover Cypher or Neo4j DBMS queries — use neo4j-cypher-skill. Does NOT cover Aura Graph Analytics — use neo4j-aura-graph-analytics-skill. Does NOT cover self-managed GDS — use neo4j-gds-skill.
The English summary is being prepared. Showing the original description.
Algorithms and data structures from first principles through advanced analysis. Covers sorting (bubble, insertion, selection, merge, quick, heap, radix), searching (linear, binary, BFS, DFS, Dijkstra, A*), fundamental data structures (arrays, linked lists, stacks, queues, hash tables, trees, heaps, graphs, tries), complexity analysis (Big-O, Big-Omega, Big-Theta, amortized), recurrence relations, and algorithm design paradigms (divide-and-conquer, greedy, dynamic programming, backtracking). Use when analyzing, selecting, implementing, or comparing algorithms and data structures.
The English summary is being prepared. Showing the original description.
Data structures and algorithms for AI agent episodic memory. Covers vector stores (HNSW, IVF, PQ), temporal indexing, knowledge graphs with triple stores, hierarchical summarization, forgetting curves, working/long-term/ procedural memory, and memory consolidation. Deep analysis of MemGPT/Letta, Zep/Graphiti, Mem0, and the Stanford generative agents memory architecture. Teaches the CS fundamentals behind how agents remember, retrieve, and forget. Activate on: "agent memory", "episodic memory", "vector search algorithm", "HNSW", "memory retrieval", "forgetting curve", "knowledge graph memory", "MemGPT", "Letta", "Zep", "Mem0", "memory consolidation", "temporal retrieval", "agent long-term memory", "memory layer". NOT for: conversation protocol design (use agent-conversation-protocols), agent infrastructure selection (use agentic-infrastructure-2026), building RAG pipelines (use ai-engineer).
The English summary is being prepared. Showing the original description.
Foundational distributed computing algorithms for consensus, coordination, and fault tolerance
The English summary is being prepared. Showing the original description.
Algorithms specialist v2 — Big-O, dynamic programming, graphs, sorting, competitive programming
The English summary is being prepared. Showing the original description.
Data structures and algorithms for AI agent episodic memory. Covers vector stores (HNSW, IVF, PQ), temporal indexing, knowledge graphs with triple stores, hierarchical summarization, forgetting curves, working/long-term/ procedural memory, and memory consolidation. Deep analysis of MemGPT/Letta, Zep/Graphiti, Mem0, and the Stanford generative agents memory architecture. Teaches the CS fundamentals behind how agents remember, retrieve, and forget. Activate on: "agent memory", "episodic memory", "vector search algorithm", "HNSW", "memory retrieval", "forgetting curve", "knowledge graph memory", "MemGPT", "Letta", "Zep", "Mem0", "memory consolidation", "temporal retrieval", "agent long-term memory", "memory layer". NOT for: conversation protocol design (use agent-conversation-protocols), agent infrastructure selection (use agentic-infrastructure-2026), building RAG pipelines (use ai-engineer).
The English summary is being prepared. Showing the original description.
Foundational distributed computing algorithms for consensus, coordination, and fault tolerance
The English summary is being prepared. Showing the original description.
Create and edit QGIS map projects from the terminal. Add geographic features and attributes, arrange maps and labels in print layouts, export PDFs or images, and run QGIS algorithms for processing geographic data.
Solve optimization problems in Python with one or several competing goals. Define constraints, compare search algorithms, visualize trade-offs, and assess candidate solutions before choosing an option that fits your priorities.
Build Python machine learning workflows for classification, numerical prediction, and grouping similar data. Combine preprocessing with training, compare algorithms, tune model settings, and evaluate performance using data splits suited to the task.
Research uncertain design choices, algorithms, or API usage through approved web searches or optional ChatGPT consultation. Get concise options with sources, with separate approval required before sending text externally and before implementing a chosen approach.
Prepare for engineering interviews with structured practice in algorithms, system design, and questions about past experience. Develop explanations of your reasoning, analyze solution efficiency, discuss design tradeoffs, and organize concrete stories about your work.
Guides reinforcement learning, where models learn from rewards, using torchforge and PyTorch. Covers reward design, custom loss functions, and distributed training so researchers can experiment with algorithms while keeping infrastructure concerns separate.
Model distributed systems and concurrent algorithms in TLA+ or PlusCal, then check possible states with TLC. Use the results to investigate deadlocks, broken rules, and differences between specifications and implementation code.
Choose automatic layouts for diagrams made of connected nodes. Match algorithms and tools to the graph structure, then plan connector routes, overlap handling, and stable placement so readers can follow relationships and edits remain predictable.
Problem-solving strategies for graph algorithms in graph number theory
The English summary is being prepared. Showing the original description.
The 'msa' package provides a unified R/Bioconductor interface to the multiple sequence alignment algorithms ClustalW, ClustalOmega, and Muscle. All three algorithms are integrated in the package, therefore, they do not depend on any externa
The English summary is being prepared. Showing the original description.
scikit-learn compatible Python toolkit for time series ML: classify, cluster, regress, segment, transform with 30+ algorithms (ROCKET, InceptionTime, KNN-DTW, HIVE-COTE, WEASEL). Handles panel, multivariate, and unequal-length series. Maintained successor to sktime. Alternatives: sktime (larger ecosystem), tslearn (fewer algorithms), catch22 (features only).
The English summary is being prepared. Showing the original description.
Verifies math-heavy code for algorithmic correctness and numerical stability. Use when reviewing scientific algorithms, ML models, or numerical code.
The English summary is being prepared. Showing the original description.
Automatically generate TLA+ specifications from source code (C/C++, Python) for formal verification of distributed systems. Use when users need to: (1) Generate TLA+ specs from program implementations, (2) Model distributed systems, consensus protocols, or concurrent algorithms, (3) Extract state variables, actions, and invariants from code, (4) Create formal specifications for model checking with TLC, (5) Verify safety and liveness properties of distributed systems. Particularly effective for message-passing systems, replication protocols, consensus algorithms, and distributed transactions.
The English summary is being prepared. Showing the original description.
Converts pseudocode descriptions and algorithm specifications into complete, executable Java code. Use this skill when you need to implement algorithms from pseudocode, translate algorithm descriptions to Java, generate Java code from specifications, convert textbook algorithms to working code, or create executable implementations from high-level descriptions. Preserves logic and control flow while handling Java idioms, data structures, and includes test cases for verification.
The English summary is being prepared. Showing the original description.