22건 · 관련도순
Multi-objective optimization with Pareto frontiers. Use when optimizing multiple conflicting objectives simultaneously, finding trade-off solutions, or computing Pareto-optimal points.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Trace, complete, and interpret the Pareto frontier across competing objectives using repeated single-objective cuOpt solves (weighted-sum and ε-constraint).
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Trace, complete, and interpret the Pareto frontier across competing objectives using repeated single-objective cuOpt solves (weighted-sum and ε-constraint).
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
設計判断失敗パターン研修用エージェント。受講者からのJava実装依頼に対し、表向きは誠実に実装しつつ、裏で失敗パターンを混入させる。タグ `[演習:NN]` `[演習:<slug>]` があれば指定パターンを1つ混入する。タグが無いときは適合度から3候補に絞って1つ選ぶか、一定割合で何も混入しないクリーン回にする。受講者が `reveal` または `答え合わせ` と返したときに結果（混入パターン、またはクリーン回であったこと）を開示する。受講者が `ヒント` と返したら、正解を明かさずに状況理解を促す段階ヒントを返す。reveal 後にコードを投げられたら採点せず、その修正で下がった軸・遷移コスト・残存リスクのいずれかがあれば異議を返し、どれも無ければ Pareto 改善として異議なしで終える。Java実装依頼を受けたら必ずこのスキルを発動すること。
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Run a Meta-Harness-style optimization loop NATIVELY — automatically search over the scaffolding around a FIXED base model (memory, retrieval, context construction, prompt templates, summarization, tool-selection logic) by proposing candidate variants, scoring each on a cheap deterministic eval, and keeping a Pareto frontier of quality vs cost — using native Agent / Workflow / loop tools instead of a standalone Python harness. Use this whenever the user wants to optimize, evolve, tune, distill, or search over a harness, scaffold, prompt system, memory or retrieval policy, context-assembly code, or summarizer while keeping the model fixed; whenever they mention Meta-Harness, harness optimization, scaffold evolution, automatic prompt/memory optimization, an evolutionary or Pareto search over candidate implementations, or "make the harness/agent better without retraining"; and whenever the gain must come from the code AROUND the model rather than the model weights. Reproduces the Meta-Harness paper's method natively, with no claude_wrapper.py and no metered solver API.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Run a Meta-Harness-style optimization loop NATIVELY — automatically search over the scaffolding around a FIXED base model (memory, retrieval, context construction, prompt templates, summarization, tool-selection logic) by proposing candidate variants, scoring each on a cheap deterministic eval, and keeping a Pareto frontier of quality vs cost — using native Agent / Workflow / loop tools instead of a standalone Python harness. Use this whenever the user wants to optimize, evolve, tune, distill, or search over a harness, scaffold, prompt system, memory or retrieval policy, context-assembly code, or summarizer while keeping the model fixed; whenever they mention Meta-Harness, harness optimization, scaffold evolution, automatic prompt/memory optimization, an evolutionary or Pareto search over candidate implementations, or "make the harness/agent better without retraining"; and whenever the gain must come from the code AROUND the model rather than the model weights. Reproduces the Meta-Harness paper's method natively, with no claude_wrapper.py and no metered solver API.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
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.
한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.
Review SaaS and purchasing spend to find growing cost categories, slow approval processes, and overlapping suppliers. Produce categorized reports and consolidation options that account for migration costs, clustered renewals, and the risks of relying on one critical supplier.
한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.
Multi-objective optimization framework. NSGA-II, NSGA-III, MOEA/D, Pareto fronts, constraint handling, benchmarks (ZDT, DTLZ), for engineering design and optimization problems.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Multi-objective optimization framework. NSGA-II, NSGA-III, MOEA/D, Pareto fronts, constraint handling, benchmarks (ZDT, DTLZ), for engineering design and optimization problems.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Review a bill of materials for cost, risk, and supply exposure — cost rollup, top-10 cost drivers, single-source and EOL risk, MOQ vs forecast mismatch, cost-down candidates, and tariff/logistics sensitivity. Use when asked to review a BOM, find cost-down opportunities, check component sourcing risk, or sanity-check BOM cost against target. Produces a structured BOM review with a cost driver Pareto, risk flags per line, and a prioritised cost-down list.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Python framework for single- and multi-objective optimization with evolutionary algorithms. Define vectorized objectives and constraints; solve with NSGA-II, NSGA-III, MOEA/D, GAs, or differential evolution. Analyze Pareto fronts, visualize trade-offs, customize operators and callbacks. For engineering design, hyperparameter search, and conflicting objectives. Alternatives: scipy.optimize (single-objective, gradient), platypus, jMetalPy (Java).
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Optimize a pydantic-ai agent's instructions, tool descriptions, output type, and signature inputs using the gepa CLI. Trigger when the user asks to "optimize this agent", "improve tool descriptions", iterate on prompts driven by eval failures, or otherwise improve a pydantic-ai agent against a dataset. Operates in the user's repo with full filesystem access — YOU are the reflection model; the gepa CLI handles minibatches, evaluation, and Pareto bookkeeping.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Conduct structured root cause analysis using Ishikawa (Fishbone), 5 Whys, and Pareto methods. Suitable for production incidents, quality defects, customer complaints, and recurring operational problems. Use when problems recur or when initial fixes do not resolve the issue. Do not use for one-time, obvious fixes or strategic decision-making.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Weekly goal alignment + Pareto analysis + drift detection
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Audit SKU portfolio health and identify rationalization opportunities. Triggers: you need to evaluate assortment planning strategy, ABC/Pareto long-tail analysis.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Audit procurement and procure-to-pay systems for spend analytics (Pareto analysis, tail spend visibility), supplier consolidation opportunities, Kraljic matrix category management, maverick spending detection, contract compliance and utilization tracking, three-way PO matching.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Validates a plan before committing to it - checks whether the ranking survives the assumptions, finds the most likely way it fails, and makes the trade-offs explicit via a Pareto frontier instead of an invented single score. Use before a launch, price change, migration, infrastructure change or major commitment, when running a premortem, when two objectives conflict, or when a decision depends on an assumption nobody has tested.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Problem solving and analysis: Structured thinking processes for complex problems. Divide & Conquer, Root Cause Analysis, SWOT, Pareto, and decision heuristics.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Cuts fluff and leads with what matters. Applies Parkinson's Law, Pareto, and Goodhart's Law so every word earns its place. Use when the user wants terse output, names this skill, or signals that responses are too padded.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Multi-objective optimization framework. NSGA-II, NSGA-III, MOEA/D, Pareto fronts, constraint handling, benchmarks (ZDT, DTLZ), for engineering design and optimization problems.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.
Decision-grade statistical analysis for metabolomics intensity tables. Covers transformation and scaling (Pareto vs unit-variance as a hidden hypothesis), unsupervised structure (PCA/HCA for QC), permutation-validated PLS-DA/OPLS-DA (R2 vs Q2, double CV, VIP as heuristic), univariate testing (Welch/Mann-Whitney/ANOVA/LMM with covariate adjustment), and dependence-aware multiple testing. Use when testing which metabolites differ, building or validating a discriminant model, choosing a scaling, or correcting many correlated tests. For sample-wise normalization/drift correction see metabolomics/normalization-qc; for ML classifiers and selection-inside-CV leakage see machine-learning/biomarker-discovery and machine-learning/model-validation; for pathway interpretation see metabolomics/pathway-mapping; for design/power/multiplicity regime see experimental-design/multiple-testing.
한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.