| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- 다양한 모듈에서 log쓰기
- The Natural Language Decathlon:Multitask Learning as Question Answering
- A Neural Attention Model for Abstractive Sentence Summarization
- Multi Task Learning Objectives for Natural Language Processing 리뷰
- MMTOD
- Evaluate Multiwoz
- 바닥부터 배우는 강화 학습
- RuntimeError: DataLoader worker (pid(s) ) exited unexpectedly
- ImageNet Classification with Deep ConvolutionalNeural Networks 리뷰
- NLP 논문 리뷰
- T5 논문 리뷰
- Attention Is All You Need 리뷰
- CNN 논문리뷰
- 정책기반 agent
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 리뷰
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 논문리뷰
- BERT 사용방법
- Zero-shot Generalization in Dialog State Tracking through GenerativeQuestion Answering
- BERT란
- 뉴텝스 400
- Multi Task Learning Objectives for Natural Language Processing
- Attention Is All You Need
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer 리뷰
- 길찾기
- TOD 논문리뷰
- hugging face tokenizer에서 special case 추가하기
- UBAR: Towards Fully End-to-End Task-Oriented Dialog System with GPT-2
- BART 논문리뷰
- attention 설명
- Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
Archives
- Today
- Total
목록프로그래머스 기능개발 (1)
one by one ◼◻◼◻
[queue]프로그래머스-기능개발
프로그래머스에서 문제를 풀어보았다. queue를 이용해서 풀어보았다. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 from collections import deque def solution(progresses, speeds): jobque = deque(progresses) speedque = deque(speeds) time =0 answer = [] go = 0 while jobque: job = jobque.popleft() speed = speedque.popleft() while True: if job + speed*time >= 100: go+=1 break else: if go != 0: answer.append(go) go =0 t..
코딩문제
2022. 1. 22. 11:15