본문으로 이동

속성:Evidence URL

S3 연구 메모리
Install S3 Research Memory canonical schema
 
Reconcile S3 Research Memory canonical schema
 
1번째 줄: 1번째 줄:
[[Has type::URL]]
[[Has type::URL]]


Optional HTTP or HTTPS location for an evidence record.
자료를 열 수 있는 HTTP 또는 HTTPS 주소입니다.

2026년 7월 16일 (목) 12:22 기준 최신판

URL

자료를 열 수 있는 HTTP 또는 HTTPS 주소입니다.

(이전 20개 | ) (20 | 50 | 100 | 250 | 500) 보기
이 속성을 사용하는 문서 20개를 보여줍니다.
a
a case for hardware based demand paging bdf187f5 +
https://yonsei.elsevierpure.com/en/publications/a-case-for-hardware-based-demand-paging/  +
a comprehensive analysis of superpage management mechanisms and policies c34f2dbd +
https://www.usenix.org/conference/atc20/presentation/zhu-weixi  +
a comprehensive analysis of superpage management mechanisms and policies c34f2dbd +
https://www.usenix.org/conference/atc20/presentation/zhu-weixi  +
a fully associative tagless dram cache f6383680 +
https://doi.org/10.1145/2749469.2750383  +
a hybrid web browser architecture for mobile devices 0a9118ea +
https://doi.org/10.4316/AECE.2014.03001  +
a neural network accelerator for mobile application processors 72ce8850 +
https://doi.org/10.1109/TCE.2015.7389812  +
a performance stable numa management scheme for linux based hpc systems 6533e8f2 +
https://doi.org/10.1109/ACCESS.2021.3069991  +
a performance stable numa management scheme for linux based hpc systems 6533e8f2 +
https://doi.org/10.1109/ACCESS.2021.3069991  +
a scalable and overflow tolerant mechanism for minimum virtual time tracking b9b92703 +
https://yonsei.elsevierpure.com/en/publications/a-scalable-and-overflow-tolerant-mechanism-for-minimum-virtual-ti/  +
a secure fast and resource efficient serverless platform with function rewind 6c6658bb +
https://www.usenix.org/conference/atc24/presentation/song  +
accl an fpga based collective engine for distributed applications 896d30fd +
https://arxiv.org/abs/2312.11742  +
accl an fpga based collective engine for distributed applications 896d30fd +
https://arxiv.org/abs/2312.11742  +
achieving low latency graph based vector search via aligning best first search algorithm with ss 77c9550f +
https://www.usenix.org/conference/osdi25/presentation/guo  +
achieving low latency graph based vector search via aligning best first search algorithm with ss 77c9550f +
https://www.usenix.org/conference/osdi25/presentation/guo  +
achieving microsecond scale tail latency efficiently with approximate optimal scheduling e8d8e302 +
https://doi.org/10.1145/3600006.3613136  +
achieving microsecond scale tail latency efficiently with approximate optimal scheduling e8d8e302 +
https://doi.org/10.1145/3600006.3613136  +
advocating for key value stores with workload pattern aware dynamic compaction 9489efc9 +
https://doi.org/10.1145/3655038.3665955  +
advocating for key value stores with workload pattern aware dynamic compaction 9489efc9 +
https://doi.org/10.1145/3655038.3665955  +
aegonkv a high bandwidth low tail latency and low storage cost kv separated lsm store with smart 5a081f42 +
https://www.usenix.org/conference/fast25/presentation/duan  +
aegonkv a high bandwidth low tail latency and low storage cost kv separated lsm store with smart 5a081f42 +
https://www.usenix.org/conference/fast25/presentation/duan  +
원본 주소 "https://s3wiki.yonsei.ac.kr/index.php?title=속성:Evidence_URL&oldid=159"