[ELDENRING:NIGHTREIGN] Brief Analysis of AI Logic in Knight Artorias
Reverse data file of ELDENRING:NIGHTREIGN. Learn AI logic and code structure by analyzing AI logic of Knight Artorias
Research, working notes, and small observations.
A collection in progress, arranged from newest to oldest.
Reverse data file of ELDENRING:NIGHTREIGN. Learn AI logic and code structure by analyzing AI logic of Knight Artorias
A novel GPU algorithm--WETRIC, counting triangles in static undirected sparse graphs.
Exact and scalable triangle counting on large-scale directed graphs, where triangles have seven different types determined by edge directions and the graph may be too large for a s
CoT (Chain-of-Thought) brings memory bottleneck (KV Cache), limits the practical deployment of LRMs (Large Reasoning Models) under constrained GPU resources.
When you see a string like RG8gdSBrbm93IEJBU0U2ND8=, random letters and numbers with = at the end, you should guess it might be a Base64 string. How does it work? How to write you
We know that Discord has a sound board, which allows you to play various weird sounds in game. But sadly it doesn't work in full screen game like ELDEN RING:NIGHTREGIN.
Delete Git/Github Commit
A self-evolving routing paradigm that dismantles the trilemma through fine-grained model selection.
Learn specclative decoding from its original paper.
FreeKV, a training-free algorithm-system co-optimization framework that boosts the efficiency of KV retrieval, while maintaining near-lossless model accuracy across diverse scenari
Show me the real process, enough meaningless formula!
hsvvrp.zjsvzlsfo.paola.lluayhujlp..pzy.bolyl.
看到这个粒子效果,我第一反应是真实的物理模拟,然后我嗯写俩小时加速度写了个抽象玩意出来😎,思路错的很。还好洗澡的时候想明白了()
使用 Rust 作服务端,基于 WebSocket 的类 IRC 网络聊天室
Implement optimize4 to improve performance as much as possible without enabling O2 or changing the algorithm.
使用Windows API CreateRemoteThread 远程注入模块到 crackme 进程中并且不崩溃,然后使用 ark 工具(例如 processhacker 等)能够查看注入模块的信息;
有MISC基础题,也有小巧思题,很好玩
An easy-to-follow introduction to UDP hole punching, NAT behavior, and a simple C++ implementation on Linux.
VMware 安卓 Ubuntu,固定 IP,SSH 远程登录
F is the family of sets over a universe U, k is a positive integer. The task is to check whether there exists a subfamily F' \subseteq F of size k that covers U, which means that e
First attempt in Unity
BV1aZ4y1f7e2是很好的教程,我自己摸索很久最后还是看了这个教程,简单有效
题意:有n个罐子,每个罐子有坚固度a_i,同时有m个钥匙,每个钥匙型号为b_i,可以打开坚固度恰好为b_i的罐子。我们可以不断攻击罐子,每次攻击让罐子的坚固度x变为x/d(向下取整)。Q次询问,每次询问L到R区间,在满足用钥匙开罐子最多的情况下,使用钥匙的最少数。
题意: 有A,B两个字符串,求f(a,b)_{max} = x*LCS(a,b)-y*|a|-z*|b|,其中x,y,z是题目里给的常数,a,b是A,B在子串。
题意:给定一个无向连通图,求至少要去掉几条边才能使图不连通,即求无向连通图的最小割
题意:给定n个点,顺次连接这些点得到折线。m次询问,每次给出一个点,询问折线绕该点的回转数
题意:对两个无序且长度任意的序列a和b进行归并,同时要求结果的字典序最小