- 📍 Av. Valbom 16, Cascais
- 📞 +351 21 482 8220
- 🌐 https://affidea.pt
- ⭐ 4.7 (809 отзывов Google)
- 🕐 Пн-Пт 8:00-20:00, Сб 8:00-13:00
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Multi-Agent Teams: State of the Art | |
| **Дата:** 24 января 2026 | |
| **Автор:** Research compilation by Claude | |
| --- | |
| ## 1. Executive Summary | |
| Multi-agent systems (MAS) стали доминирующей парадигмой в AI/LLM разработке 2025-2026: |
arXiv: https://arxiv.org/abs/2601.15709 Авторы: Asim Biswal, Chuan Lei, Xiao Qin, Aodong Li, Balakrishnan Narayanaswamy, Tim Kraska
Идея: Вместо сырых логов агент сохраняет execution traces как структурированные программы. При новом запросе ищет семантически похожие задачи и переиспользует их логику решения.
Результаты: −25% токенов, −35% шагов, SOTA на Spider 2.0 (44.8%)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # OpenAI Codex Multiagent: Research Report | |
| **Дата:** 24 января 2026 | |
| **Автор:** Research compilation by Claude | |
| --- | |
| ## 1. Executive Summary | |
| OpenAI Codex эволюционировал от простого кодогенератора (2021) в полноценную **multiagent cloud-based платформу для software engineering** (2025-2026). Ключевые модели: codex-1, GPT-5.1-Codex-Max, GPT-5.2-Codex. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| time ollama run glm-4.7-flash "implement promise funciton in js from scratch" > result.md | |
| ollama run glm-4.7-flash "implement promise funciton in js from scratch" > 0.23s user 0.38s system 1% cpu 49.968 total |
This specification defines how FHIR canonical resources and packages are:
- Authored (i.e., created and maintained in Implementation Guides (IGs))
- Assembled (Configured) into final systems by users
- Executed (Runtime) to provide functionality
Suggest an algorithm to turn linear structures like this
[ {path: 'a', value: 'k'}, {path: 'b', value: 'l'}, {path: 'b.c', value: 'm'}, {path: 'd', value: 'n')]list of path and value objects into a nested data-structure like this:
{ elements: { a: {value: 'k'}, b: {value: 'l', elements: {c: {value: 'm'}}, d: {value: 'n'}}
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| grammar fhirpathmini; | |
| path : expr EOF ; | |
| expr : expr AMPERSAND expr # concatexpr | |
| | chain # chainexpr | |
| ; | |
| chain : ( variable | element ) (DOT ( element | funcall | where ) | index)*; | |
| variable : VARIABLE ; |