Results for “efficiency”

Evaluates the throughput and resource allocation efficiency of RIS-aided mobile edge computing systems by measuring the total computation task bits successfully completed under varying network conditions.

Optimize context usage for the session by reducing bloat, improving token efficiency, and focusing on relevant areas. Use when context is growing large, responses are slow, or switching between unrelated tasks. Covers context analysis, compacting, targeted pruning, MCP-first strategies, and focused scoping by area.

Extends effective context capacity through strategic compression, masking, caching, and partitioning techniques.

Use when facing multiple implementation tasks that could benefit from parallelization or when deciding between solo, parallel agent, sequential subagent, or agent team approaches

`analysis-agent`/`task-agent`/`review-agent`: use when latency, throughput, bundle, memory, CPU, query, rendering, or resource cost needs a budget; skip without performance risk.

Write efficient C code with proper memory management, pointer arithmetic, and system calls. Handles embedded systems, kernel modules, and performance-critical code. Use PROACTIVELY for C optimization, memory issues, or system programming.

Optimizes smart contract gas consumption with storage patterns, batch operations, and assembly usage

Diagnose and fix macOS resource pressure for Claude Code workflows. Use when load avg is high, swap is saturated, CC feels slow, or before spinning up parallel agents/worktrees. Covers CPU top-talkers, swap pressure, zombie claude processes, Node heap tuning, Spotlight/background-agent pruning, and purge. Apple Silicon aware.

Reduces AI API costs by 30-75% by classifying task complexity, checking prompt quality, and routing tasks to the most cost-efficient model tier before execution.

Evaluates computational throughput and real-time efficiency of embedded CPU and GPU platforms by measuring peak FLOPS via a matrix rotation kernel and assessing inference latency and power consumption on a robotic vision pipeline.

Builds a local knowledge graph of a codebase using tree-sitter and graph algorithms, then answers architecture questions by querying the graph instead of reading many files, saving tokens.

Transform the agent into a performance engineer. Apply methodologies for measuring, profiling, and optimizing code (caching, algorithm complexity, resource usage).

Audits AGENTS.md and CLAUDE.md files for bloat, redundancy, and ineffective rules, then runs A/B evals to prove which instructions are dead weight.

Measures inference latency of binarized, 8-bit, and 32-bit convolutional layers on edge devices to evaluate the efficiency and speedup of the Larq Compute Engine framework compared to standard implementations.

Benchmarks energy-function-based safe control algorithms on the BIS (Benchmark of Interactive Safety) dataset, scoring safety, efficiency, and hybrid performance in human-robot and robot co-working scenarios.