Results for “algorithm”

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.

Creating algorithmic art using p5.js with seeded randomness and interactive parameter exploration. Use this when users request creating art using code, generative art, algorithmic art, flow fields, or particle systems. Create original algorithmic art rather than copying existing artists' work to avoid copyright violations.

The English summary is being prepared. Showing the original description.

Creating algorithmic art using p5.js with seeded randomness and interactive parameter exploration. Use this when users request creating art using code, generative art, algorithmic art, flow fields, or particle systems. Create original algorithmic art rather than copying existing artists' work to avoid copyright violations.

The English summary is being prepared. Showing the original description.

Creating algorithmic art using p5.js with seeded randomness and interactive parameter exploration. Use this when users request creating art using code, generative art, algorithmic art, flow fields, or particle systems. Create original algorithmic art rather than copying existing artists' work to avoid copyright violations.

The English summary is being prepared. Showing the original description.

Review and rewrite Twitter drafts using insights from its open-source recommendation algorithm. The skill examines audience fit, replies, sharing, and negative reactions, then explains suggested edits and ways to refine your content strategy.

• Revise a draft to encourage replies and sharing
• Explore why a tweet received little engagement
• Refine a posting strategy for a specific community

Turn a theme into generative art, artwork created by computational rules, using p5.js. Receive a written artistic philosophy and an interactive HTML viewer with adjustable parameters, reproducible variations, and PNG download controls.

• Creating generative art from a theme
• Exploring particle and flow-based compositions
• Comparing reproducible variations using seeds

Set up model training with torchforge for reinforcement learning, where rewards guide improvement. Covers training configurations, custom reward and loss functions, and distributed execution with Monarch and TorchTitan, keeping algorithm experiments separate from infrastructure concerns.

• Train mathematical reasoning models with GRPO
• Experiment with custom reward and loss functions
• Scale training across multiple GPUs or nodes

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.

• Practicing algorithm problems and explaining solutions
• Rehearsing system design interviews
• Structuring stories about past work experience

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.

• Train mathematical reasoning models with GRPO
• Experiment with custom loss functions
• Scale training across multiple GPUs or nodes

Compile and improve existing English or Chinese academic papers written in Typst. Check references, formatting, prose, argument flow, abstracts, tables, and pseudocode, with source-level review comments and support for adapting papers to another publication venue.

• Diagnosing Typst compilation and export errors
• Validating BibTeX or Hayagriva references
• Reviewing abstracts and the logic of paper sections

Build SHA hashing applications for BlueField or ConnectX accelerators with guidance on single-request versus chunked processing, supported algorithms, buffer sizes, memory permissions, and errors returned by the DOCA SHA API.

• Offloading SHA-256 hashing to BlueField
• Choosing single-request or chunked hashing
• Checking algorithm support and buffer limits

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.

Explain and configure individual spacing algorithms using student performance data and forgetting curves. Use when personalising retention schedules in adaptive learning platforms.

The English summary is being prepared. Showing the original description.

Generate deterministic SVG algorithmic artwork. Invoke when the user asks for geometric, generative, or algorithmic visual art.

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.

Algorithmic philosophies are computational aesthetic movements that are then expressed through code. Output .md files (philosophy), .html files (interactive viewer), and .js files (generative algorithms).

The English summary is being prepared. Showing the original description.

Conducts a Data Protection Impact Assessment for automated decision-making and profiling systems under GDPR Article 35(3)(a), covering algorithmic transparency, meaningful human oversight, contestation mechanisms, and Art. 22 safeguards. Activate for DPIA automated decision, profiling DPIA, algorithmic impact assessment, Art. 35(3)(a), ADM risk assessment queries.

The English summary is being prepared. Showing the original description.

Implements profiling restrictions for children under GDPR Recital 71, Article 22, UK AADC Standard 12, and COPPA. Covers prohibition of behavioural advertising to children, recommendation algorithm limitations, nudge technique prohibition, and automated decision-making safeguards. Keywords: profiling, children, behavioural advertising, recommendation algorithm, AADC, automated decision.

The English summary is being prepared. Showing the original description.

Guides the combined DPIA and AI Act conformity assessment for AI systems processing personal data. Covers EDPB-EDPS Joint Opinion 5/2021, training data lawfulness under Art. 6 and Art. 9, Art. 22 automated decision-making, algorithmic bias detection, and NIST AI RMF MAP function. Keywords: AI privacy, DPIA, AI Act, algorithmic bias, automated decision-making, Art. 22, training data, NIST AI RMF.

The English summary is being prepared. Showing the original description.

Algorithmia integration. Manage data, records, and automate workflows. Use when the user wants to interact with Algorithmia data.

The English summary is being prepared. Showing the original description.

Extract language-agnostic pseudocode from formally verified programs (Isabelle/HOL, Coq) while preserving verified control flow, data dependencies, and algorithmic logic. Use when: (1) Users have verified code and need readable pseudocode, (2) Documenting verified algorithms for broader audiences, (3) Translating verified implementations to other languages, (4) Creating algorithm specifications from verified code, (5) Preserving verification guarantees in pseudocode form, or (6) Abstracting proof-heavy code to essential logic. Maintains semantic faithfulness to verified implementation.

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.

Creative technologist specializing in algorithmic art, shaders, and generative systemsUse when "generative art, creative coding, processing, p5.js, shader art, algorithmic art, art from code, nft art, creative-coding, generative, shaders, processing, p5js, algorithmic-art, nft-art" mentioned.

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.