'task-decomposition' 검색 결과

Convert technical plans into actionable development tasks with dependency graphs, effort estimates, and parallelization opportunities.

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

Breaks down complex software, writing, or research tasks into small, atomic, independently completable units with dependency graphs and milestone breakdowns. Use when the user asks to plan a project, decompose a feature, create subtasks, split up work, or needs help organizing a large piece of work into a step-by-step plan. Triggered by phrases like "break down", "decompose", "where do I start", "too big", "split into tasks", "work breakdown", or "task list".

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

Analyzes large tasks for independent subtasks that can be safely parallelized. Produces a DAG-based dispatch plan with dependency ordering and maximum parallelism. Use when a task has 5+ subtasks touching independent files, or the user asks to speed up or parallelize the work.

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

Use when an analiz task arrives in done (approved) - turn the approved split into implementation tasks with repository, AC, derived_from and ordering arguments

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

AI Product Owner - GOALだけ伝えればAIが勝手に仕事を進める汎用問題解決システム

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

Decomposes a contextualized plan into atomic, independently executable tasks with complete embedded context, registered through the plan API. Use after SAM Stage 3 Context Integration produces the contextualized plan artifact — when the plan is ready for task generation with CLEAR ordering, CoVe checks, and dependency graphs for parallel execution.

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

The intelligence layer of WinDAGs. Decomposes natural language tasks into Hierarchical Task DAGs (HTDAGs), matches subtasks to skills, executes waves in parallel, and dynamically expands nodes when complexity exceeds executor capability. Use for 'orchestrate', 'execute DAG', 'parallel agents', 'decompose task', 'coordinate skills'. NOT for single-skill tasks or simple linear workflows.

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

Algorithms for decomposing DAGs into chains for parallel execution and resource optimization

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

Parses complex problems into DAG (Directed Acyclic Graph) execution structures. Decomposes tasks into nodes with dependencies, identifies parallelization opportunities, and creates optimal execution plans. Activate on 'build dag', 'create workflow graph', 'decompose task', 'execution graph', 'task graph'. NOT for simple linear tasks or when an existing DAG structure is provided.

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

Manages git worktrees for parallel agent isolation. Creates isolated worktrees for parallel agents on parallel/{name}-{timestamp} branches, merges results with conflict detection, prunes stale metadata, and reports health status. NOT for user-initiated feature branches — use git worktree directly for that.

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

Auto-decompose large tasks into DAG-compatible parallel subtasks

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

planner エージェントによるタスク分解。design.md を基に TaskCreate でネイティブタスクに登録。「タスクに分解して」「タスク分解して」「実装計画を立てて」「何から始める？」で発動。

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

Parses complex problems into candidate DAG (Directed Acyclic Graph) execution structures. Decomposes tasks into nodes with dependencies and identifies candidate parallelization opportunities. Activate on 'build dag', 'create workflow graph', 'decompose task', 'execution graph', 'task graph'. NOT for simple linear tasks or when an existing DAG structure is provided.

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

The intelligence layer of Jury-rig. Decomposes natural language tasks into proposed Hierarchical Task DAGs (HTDAGs), matches subtasks to skills, proposes wave and revision contracts, and expands nodes only when evidence supports a revised graph. Use for 'orchestrate', 'execute DAG', 'parallel agents', 'decompose task', 'coordinate skills'. NOT for single-skill tasks or simple linear workflows.

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

Validate finite-DAG order objectives and construct reachability-chain or direct-edge path partitions with explicit proof boundaries. NOT for equating reachability chains with direct-edge paths without checking the chosen objective.

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