'solver' 검색 결과

德州扑克策略 (德州扑克策略 (Texas Hold'em) — solver/GTO 时代的无限注德州扑克竞技打法，牌手/职业视角。覆盖: (a) 理论两极 — GTO 博弈论均衡 (不可剥削的基线策略) vs Exploitative 剥削打法 (针对对手漏洞偏离均衡最大化 EV)，以及二者的实战取舍; (b) solver 时代工作流 — PioSOLVER/GTO Wizard 跑解、范围构建、节点锁定 (node-locking) 做剥削、用 HUD+数据库 (Hold'em Manager/PokerTracker/Hand2Note) 复盘找漏洞 (leak finding); (c) 牌型分层 — 现金局 (cash game) vs 锦标赛 (MTT) 的根本差异，后者叠加 ICM (独立筹码模型) 与跳台/泡沫期博弈; (d) 核心概念栈 — 范围 (range)/权益 (equity)/EV/位置 (position)/翻前开池与 3-bet/4-bet/翻后下注理论 (c-bet、极化 vs 浓缩范围、MDF 最小防守频率、阻断牌 blockers、超池下注 overbet)、SPR、底池赔率; (e) 元层 — 资金管理 (bankroll management)、桌位选择 (table selection)、方差与心态 (mental game/tilt 控制)、抽水 (rake) 与场次选择对长期赢率 (winrate, bb/100) 的影响; (f) 智识演进 — 从 Sklansky 古典手牌价值 → Janda/Tipton 博弈论 → solver 普及 → GTO Wizard 民主化求解 → AI 超人 (Libratus/Pluribus) 对人类策略的反哺。学派分歧: GTO 派 vs 剥削派、现金局 vs 锦标赛、理论自上而下 vs 牌局自下而上、solver 纯学院派 vs 实战感觉派。不含: 线下牌场运营/发牌荷官、博彩合规与赌场管理、扑克之外的牌类 (桥牌/斗地主)、纯概率赌博 (老虎机/轮盘)。) Master OS — automated mastery of 德州扑克策略 (Texas Hold'em) — solver/GTO 时代的无限注德州扑克竞技打法，牌手/职业视角。覆盖: (a) 理论两极 — GTO 博弈论均衡 (不可剥削的基线策略) vs Exploitative 剥削打法 (针对对手漏洞偏离均衡最大化 EV)，以及二者的实战取舍; (b) solver 时代工作流 — PioSOLVER/GTO Wizard 跑解、范围构建、节点锁定 (node-locking) 做剥削、用 HUD+数据库 (Hold'em Manager/PokerTracker/Hand2Note) 复盘找漏洞 (leak finding); (c) 牌型分层 — 现金局 (cash game) vs 锦标赛 (MTT) 的根本差异，后者叠加 ICM (独立筹码模型) 与跳台/泡沫期博弈; (d) 核心概念栈 — 范围 (range)/权益 (equity)/EV/位置 (position)/翻前开池与 3-bet/4-bet/翻后下注理论 (c-bet、极化 vs 浓缩范围、MDF 最小防守频率、阻断牌 blockers、超池下注 overbet)、SPR、底池赔率; (e) 元层 — 资金管理 (bankroll management)、桌位选择 (table selection)、方差与心态 (mental game/tilt 控制)、抽水 (rake) 与场次选择对长期赢率 (winrate, bb/100) 的影响; (f) 智识演进 — 从 Sklansky 古典手牌价值 → Janda/Tipton 博弈论 → solver 普及 → GTO Wizard 民主化求解 → AI 超人 (Libratus/Pluribus) 对人类策略的反哺。学派分歧: GTO 派 vs 剥削派、现金局 vs 锦标赛、理论自上而下 vs 牌局自下而上、solver 纯学院派 vs 实战感觉派。不含: 线下牌场运营/发牌荷官、博彩合规与赌场管理、扑克之外的牌类 (桥牌/斗地主)、纯概率赌博 (老虎机/轮盘)。: top builders' mental models, tool stack, current workflows, jargon, and where to keep up. Trigger this skill when the user works on 德州扑克策略 (Texas Hold'em) — solver/GTO 时代的无限注德州扑克竞技打法，牌手/职业视角。覆盖: (a) 理论两极 — GTO 博弈论均衡 (不可剥削的基线策略) vs Exploitative 剥削打法 (针对对手漏洞偏离均衡最大化 EV)，以及二者的实战取舍; (b) solver 时代工作流 — PioSOLVER/GTO Wizard 跑解、范围构建、节点锁定 (node-locking) 做剥削、用 HUD+数据库 (Hold'em Manager/PokerTracker/Hand2Note) 复盘找漏洞 (leak finding); (c) 牌型分层 — 现金局 (cash game) vs 锦标赛 (MTT) 的根本差异，后者叠加 ICM (独立筹码模型) 与跳台/泡沫期博弈; (d) 核心概念栈 — 范围 (range)/权益 (equity)/EV/位置 (position)/翻前开池与 3-bet/4-bet/翻后下注理论 (c-bet、极化 vs 浓缩范围、MDF 最小防守频率、阻断牌 blockers、超池下注 overbet)、SPR、底池赔率; (e) 元层 — 资金管理 (bankroll management)、桌位选择 (table selection)、方差与心态 (mental game/tilt 控制)、抽水 (rake) 与场次选择对长期赢率 (winrate, bb/100) 的影响; (f) 智识演进 — 从 Sklansky 古典手牌价值 → Janda/Tipton 博弈论 → solver 普及 → GTO Wizard 民主化求解 → AI 超人 (Libratus/Pluribus) 对人类策略的反哺。学派分歧: GTO 派 vs 剥削派、现金局 vs 锦标赛、理论自上而下 vs 牌局自下而上、solver 纯学院派 vs 实战感觉派。不含: 线下牌场运营/发牌荷官、博彩合规与赌场管理、扑克之外的牌类 (桥牌/斗地主)、纯概率赌博 (老虎机/轮盘)。 problems and wants industry-grade thinking, tool selection, or workflow guidance. 触发词：「德州扑克」「德扑」「Texas Hold'em」「poker strategy」「扑克策略」

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Reduce the size of AGENTS.md or RESOLVER.md by grouping skills into functional areas. Each area keeps a list of its sub-skills, helping the agent find the appropriate skill through a two-level routing structure.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Shortening a large AGENTS.md
• Grouping skill routes by functional area
• Checking routing accuracy after compression

Analyze Go malware binaries in Ghidra by extracting build metadata, function names, dependencies, and relevant strings. Use GoResolver to help recover obscured names and organize functions so analysts can focus their reverse engineering work.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Investigating the structure of a Go malware sample
• Recovering function names from stripped or obfuscated binaries
• Identifying embedded Go modules and dependencies

Operational workflow for hard integer-programming optimization tasks: selecting an installed solver, preserving solver/incumbent certificates, extracting feasible schedules, recomputing metrics from final outputs, and writing consistent reports. Use when a task requires a MIP, solver status, objective value, bound, gap, formulation write-up, or benchmark output files.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Plan and review fluid simulations with FluidSim, from solver selection and resource estimates to output analysis and restart checks. Examine numerical accuracy through grid and time-step comparisons, conservation checks, and explicit limits on computing resources.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Selecting a solver and reviewing simulation parameters
• Estimating memory, disk space, and runtime needs
• Inspecting spectra and conservation budgets

Build stablecoin transfers where the amount sent equals the amount received using LI.FI Intents. The skill covers quotes, token approval, escrow deposits, and order tracking for transfers within or across supported blockchains.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Building a stablecoin swap interface with equal input and output amounts
• Adding cross-chain USDC or USDT transfers
• Implementing quotes, approvals, and escrow orders in a backend

Configures Amazon Route 53 DNS: public and private records, traffic-steering routing policies, health checks, DNS Firewall, Route 53 Profiles, VPC Resolver (also known as Route 53 Resolver) for hybrid and Outposts networks, and Global Resolver. Applicable when the customer wants to point a hostname at a target, split or fail over traffic across endpoints, monitor an endpoint, block malicious domains, centralize DNS across accounts, or resolve private DNS across a hybrid network. Routes to the right per-task procedure in references. Does not cover CloudFront-specific setup (see the route53-cloudfront skill) or non-DNS networking.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Use for formulating, solving, debugging, and validating mixed-integer linear optimization models with open-source solvers, including variable indexing, sparse constraints, linearized costs, solver limits, MIP gaps, incumbent extraction, numerical tolerances, and deterministic output reporting.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Use when writing, solving, or debugging MATLAB optimization code — formulating problems (optimproblem, optimvar, fcn2optimexpr), selecting and configuring solvers (fmincon, linprog, quadprog, intlinprog, lsqnonlin, ga, surrogateopt, optimoptions), or validating results (exitflag, convergence, constraint violations). Covers problem-based and solver-based approaches, solver tuning, and solution verification.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Use DPM-Solver and DPM-Solver++ single-file samplers for diffusion ODE sampling, PyTorch/JAX integration, ScoreSDE/DDPM examples, and Stable Diffusion acceleration.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Master problem solver for systematic problem-solving methodologies. Use when the user asks to talk to Dr. Quinn or requests the Master Problem Solver.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

GraphQL gives clients exactly the data they need - no more, no less. One endpoint, typed schema, introspection. But the flexibility that makes it powerful also makes it dangerous. Without proper controls, clients can craft queries that bring down your server. This skill covers schema design, resolvers, DataLoader for N+1 prevention, federation for microservices, and client integration with Apollo/urql. Key insight: GraphQL is a contract. The schema is the API documentation. Design it carefully. 2025 lesson: GraphQL isn't always the answer. For simple CRUD, REST is simpler. For high-performance public APIs, REST with caching wins. Use GraphQL when you have complex data relationships and diverse client needs. Use when "graphql, graphql schema, graphql resolver, apollo server, apollo client, graphql federation, dataloader, graphql codegen, graphql query, graphql mutation, graphql, api, apollo, schema, resolvers, dataloader, federation, typescript" mentioned.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

GraphQL API specialist for schema design, resolvers, federation, and performance optimizationUse when "graphql, schema design, resolvers, federation, apollo, relay, dataloader, n+1 problem, graphql security, graphql, api, schema, resolvers, federation, subscriptions, apollo, relay, dataloader" mentioned.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

End-to-end plan → implement → review pipeline that takes one triaged Gaia issue to a merged-ready PR, with Kill Criteria on the issue and zero follow-up debt. Use when someone says: "resolve this issue", "take #N end-to-end", "work the P0 queue", "fix and ship this issue", "run the resolver", "close out this issue properly", or /gaia-issue-resolver. Works any gaia-research org repo — gaia-skill-tree, gaia-research, gaia-skill-heaven — while the issue itself lives on the headquarters tracker, gaia-research/gaia-skill-tree. Assumes the issue is already triaged and carries a P0–P4 label; if it does not, run /gaia-triage first.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Diagnose and eliminate the GraphQL N+1 resolver explosion using Facebook DataLoader's per-request batching, plus the second-order defenses (persisted queries, depth limits, cost analysis). Use when a GraphQL query that returns N items in a list triggers N+1 database round trips, when designing nested resolvers that load associations, when a list query times out under load, or when you need to budget query cost before resolvers run. NOT for REST-style endpoint design (use api-versioning-strategy), generic database query optimization (use database-query-optimizer), or schema design (use graphql-server-architect).

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

CTF challenge ana orkestratörü — kategori tespiti, modern saldırı patern tanıma, ilgili skill arama, cross-skill zincir koordinasyonu, hızlı referans erişim. Auto-solver ve hint-system routing.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Use when implementing GraphQL resolvers with Absinthe. Covers resolver patterns, dataloader integration, batching, and error handling.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.

Analyze large matrices before solving linear systems. Check structure and numerical stability, recommend preprocessing and solver settings, estimate selected solution values without a full solve, and assess convergence, memory use, and computational cost.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Checking matrix properties before solving a system
• Choosing preprocessing for numerical stability
• Estimating selected values without solving the full system

Simulate lithium-ion battery charging, discharging, and rest with PyBaMM. Track voltage and capacity, record parameter sources, check how numerical settings affect predictions, and compare simulated curves with measured cycling data.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Predicting voltage changes during charge, discharge, and rest
• Comparing simulation results with measured cycling data
• Checking how numerical settings affect predictions

Simulate quantum dynamics, steady states, and spectra with QuTiP 5. The skill guides solver selection and checks physical assumptions, units, state validity, and numerical convergence so local simulation results can be reviewed with their limitations.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Simulating quantum dynamics with environmental dissipation
• Choosing a solver for a quantum model
• Checking numerical convergence and state validity

Create skills that follow GBrain’s required structure, including workflow steps, expected output, and failure handling. Check for overlapping triggers, update the skill registry and routing guide, and verify the result with conformance tests.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Create a skill for an uncovered user request
• Check for overlap with existing skill triggers
• Update skill registration and routing

Design GraphQL APIs with clear data types, data-fetching functions called resolvers, and real-time updates. Address repeated database calls, pagination, structured errors, and expensive queries while planning schema changes that preserve compatibility.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Designing schemas around business concepts
• Reducing repeated database calls with DataLoader
• Planning real-time subscriptions over WebSocket

Guide the use of NVIDIA cuOpt for route planning and mathematical optimization, choosing values to minimize cost or maximize profit under constraints. Covers requirements, environment checks, installation guidance, and verification of solver results.

한국어 요약은 준비 중입니다. 영어 요약을 표시하고 있습니다.

• Clarify vehicle routing requirements and constraints
• Plan how to use cuOpt through Python, REST, C, or CLI
• Review installation and server setup options

Nonlinear optimization with CasADi and IPOPT solver. Use when building and solving NLP problems: defining symbolic variables, adding nonlinear constraints, setting solver options, handling multiple initializations, and extracting solutions. Covers power systems optimization patterns including per-unit scaling and complex number formulations.

한국어 요약은 준비 중입니다. 원문 설명을 표시하고 있습니다.