id	sid	tid	token	lemma	pos
fcis-15176	1	1	frontiers	frontier	NOUN
fcis-15176	1	2	in	in	ADP
fcis-15176	1	3	computing	computing	NOUN
fcis-15176	1	4	and	and	CCONJ
fcis-15176	1	5	intelligent	intelligent	ADJ
fcis-15176	1	6	systems	system	NOUN
fcis-15176	1	7	issn	issn	VERB
fcis-15176	1	8	:	:	PUNCT
fcis-15176	1	9	2832	2832	NUM
fcis-15176	1	10	-	-	SYM
fcis-15176	1	11	6024	6024	NUM
fcis-15176	1	12	|	|	NOUN
fcis-15176	1	13	vol	vol	NOUN
fcis-15176	1	14	.	.	PROPN
fcis-15176	2	1	6	6	NUM
fcis-15176	2	2	,	,	PUNCT
fcis-15176	2	3	no	no	INTJ
fcis-15176	2	4	.	.	NOUN
fcis-15176	2	5	2	2	NUM
fcis-15176	2	6	,	,	PUNCT
fcis-15176	2	7	2023	2023	NUM
fcis-15176	2	8	52	52	NUM
fcis-15176	2	9	"	"	PUNCT
fcis-15176	2	10	algorithm	algorithm	NOUN
fcis-15176	2	11	analysis	analysis	NOUN
fcis-15176	2	12	and	and	CCONJ
fcis-15176	2	13	design	design	NOUN
fcis-15176	2	14	"	"	PUNCT
fcis-15176	2	15	python	python	PROPN
fcis-15176	2	16	teaching	teaching	NOUN
fcis-15176	2	17	example	example	NOUN
fcis-15176	2	18	of	of	ADP
fcis-15176	2	19	greedy	greedy	ADJ
fcis-15176	2	20	and	and	CCONJ
fcis-15176	2	21	dynamic	dynamic	ADJ
fcis-15176	2	22	programming	programming	NOUN
fcis-15176	2	23	ying	ying	PROPN
fcis-15176	2	24	zhang	zhang	PROPN
fcis-15176	3	1	1	1	NUM
fcis-15176	3	2	,	,	PUNCT
fcis-15176	3	3	lele	lele	NOUN
fcis-15176	3	4	xi	xi	ADP
fcis-15176	3	5	1	1	NUM
fcis-15176	3	6	,	,	PUNCT
fcis-15176	3	7	yixia	yixia	NOUN
fcis-15176	3	8	wu	wu	PROPN
fcis-15176	3	9	1	1	NUM
fcis-15176	3	10	,	,	PUNCT
fcis-15176	3	11	canping	canpe	VERB
fcis-15176	3	12	li	li	PROPN
fcis-15176	3	13	2	2	NUM
fcis-15176	3	14	,	,	PUNCT
fcis-15176	3	15	zebin	zebin	PROPN
fcis-15176	3	16	ma	ma	PROPN
fcis-15176	3	17	1	1	NUM
fcis-15176	3	18	,	,	PUNCT
fcis-15176	3	19	*	*	PUNCT
fcis-15176	3	20	1	1	NUM
fcis-15176	3	21	school	school	NOUN
fcis-15176	3	22	of	of	ADP
fcis-15176	3	23	mathematics	mathematic	NOUN
fcis-15176	3	24	and	and	CCONJ
fcis-15176	3	25	computer	computer	NOUN
fcis-15176	3	26	,	,	PUNCT
fcis-15176	3	27	guangdong	guangdong	PROPN
fcis-15176	3	28	ocean	ocean	PROPN
fcis-15176	3	29	university	university	PROPN
fcis-15176	3	30	,	,	PUNCT
fcis-15176	3	31	524088	524088	NUM
fcis-15176	3	32	,	,	PUNCT
fcis-15176	3	33	china	china	PROPN
fcis-15176	3	34	2	2	NUM
fcis-15176	3	35	school	school	NOUN
fcis-15176	3	36	of	of	ADP
fcis-15176	3	37	electronics	electronic	NOUN
fcis-15176	3	38	and	and	CCONJ
fcis-15176	3	39	information	information	NOUN
fcis-15176	3	40	engineering	engineering	NOUN
fcis-15176	3	41	,	,	PUNCT
fcis-15176	3	42	guangdong	guangdong	PROPN
fcis-15176	3	43	ocean	ocean	PROPN
fcis-15176	3	44	university	university	PROPN
fcis-15176	3	45	,	,	PUNCT
fcis-15176	3	46	524088	524088	NUM
fcis-15176	3	47	,	,	PUNCT
fcis-15176	3	48	china	china	PROPN
fcis-15176	3	49	*	*	PUNCT
fcis-15176	3	50	corresponding	correspond	VERB
fcis-15176	3	51	author	author	NOUN
fcis-15176	3	52	:	:	PUNCT
fcis-15176	3	53	zebin	zebin	PROPN
fcis-15176	3	54	ma	ma	PROPN
fcis-15176	3	55	(	(	PUNCT
fcis-15176	3	56	email	email	NOUN
fcis-15176	3	57	:	:	PUNCT
fcis-15176	3	58	mazebin@stu.gdou.edu.cn	mazebin@stu.gdou.edu.cn	NOUN
fcis-15176	3	59	)	)	PUNCT
fcis-15176	3	60	abstract	abstract	NOUN
fcis-15176	3	61	:	:	PUNCT
fcis-15176	3	62	the	the	DET
fcis-15176	3	63	greedy	greedy	ADJ
fcis-15176	3	64	algorithm	algorithm	NOUN
fcis-15176	3	65	and	and	CCONJ
fcis-15176	3	66	dynamic	dynamic	ADJ
fcis-15176	3	67	programming	programming	NOUN
fcis-15176	3	68	algorithm	algorithm	NOUN
fcis-15176	3	69	have	have	AUX
fcis-15176	3	70	always	always	ADV
fcis-15176	3	71	been	be	AUX
fcis-15176	3	72	difficult	difficult	ADJ
fcis-15176	3	73	for	for	SCONJ
fcis-15176	3	74	students	student	NOUN
fcis-15176	3	75	to	to	PART
fcis-15176	3	76	understand	understand	VERB
fcis-15176	3	77	in	in	ADP
fcis-15176	3	78	the	the	DET
fcis-15176	3	79	course	course	NOUN
fcis-15176	3	80	of	of	ADP
fcis-15176	3	81	algorithm	algorithm	NOUN
fcis-15176	3	82	analysis	analysis	NOUN
fcis-15176	3	83	and	and	CCONJ
fcis-15176	3	84	design	design	NOUN
fcis-15176	3	85	.	.	PUNCT
fcis-15176	4	1	this	this	DET
fcis-15176	4	2	article	article	NOUN
fcis-15176	4	3	uses	use	VERB
fcis-15176	4	4	python	python	NOUN
fcis-15176	4	5	as	as	ADP
fcis-15176	4	6	a	a	DET
fcis-15176	4	7	descriptive	descriptive	ADJ
fcis-15176	4	8	language	language	NOUN
fcis-15176	4	9	and	and	CCONJ
fcis-15176	4	10	selects	select	VERB
fcis-15176	4	11	classic	classic	ADJ
fcis-15176	4	12	examples	example	NOUN
fcis-15176	4	13	of	of	ADP
fcis-15176	4	14	greedy	greedy	ADJ
fcis-15176	4	15	and	and	CCONJ
fcis-15176	4	16	dynamic	dynamic	ADJ
fcis-15176	4	17	programming	programming	NOUN
fcis-15176	4	18	algorithms	algorithm	NOUN
fcis-15176	4	19	to	to	PART
fcis-15176	4	20	analyze	analyze	VERB
fcis-15176	4	21	these	these	DET
fcis-15176	4	22	two	two	NUM
fcis-15176	4	23	algorithms	algorithm	NOUN
fcis-15176	4	24	in	in	ADP
fcis-15176	4	25	detail	detail	NOUN
fcis-15176	4	26	,	,	PUNCT
fcis-15176	4	27	providing	provide	VERB
fcis-15176	4	28	effective	effective	ADJ
fcis-15176	4	29	references	reference	NOUN
fcis-15176	4	30	for	for	ADP
fcis-15176	4	31	learning	learn	VERB
fcis-15176	4	32	the	the	DET
fcis-15176	4	33	python	python	NOUN
fcis-15176	4	34	language	language	NOUN
fcis-15176	4	35	.	.	PUNCT
fcis-15176	5	1	keywords	keyword	NOUN
fcis-15176	5	2	:	:	PUNCT
fcis-15176	5	3	algorithm	algorithm	NOUN
fcis-15176	5	4	design	design	NOUN
fcis-15176	5	5	and	and	CCONJ
fcis-15176	5	6	analysis	analysis	NOUN
fcis-15176	5	7	;	;	PUNCT
fcis-15176	5	8	python	python	NOUN
fcis-15176	5	9	;	;	PUNCT
fcis-15176	5	10	experimental	experimental	ADJ
fcis-15176	5	11	teaching	teaching	NOUN
fcis-15176	5	12	;	;	PUNCT
fcis-15176	5	13	greed	greed	NOUN
fcis-15176	5	14	;	;	PUNCT
fcis-15176	5	15	dynamic	dynamic	ADJ
fcis-15176	5	16	planning	planning	NOUN
fcis-15176	5	17	.	.	PUNCT
fcis-15176	6	1	1	1	X
fcis-15176	6	2	.	.	X
fcis-15176	6	3	introduction	introduction	NOUN
fcis-15176	6	4	both	both	CCONJ
fcis-15176	6	5	the	the	DET
fcis-15176	6	6	greedy	greedy	ADJ
fcis-15176	6	7	algorithm	algorithm	NOUN
fcis-15176	6	8	and	and	CCONJ
fcis-15176	6	9	the	the	DET
fcis-15176	6	10	dynamic	dynamic	ADJ
fcis-15176	6	11	programming	programming	NOUN
fcis-15176	6	12	algorithm	algorithm	NOUN
fcis-15176	6	13	are	be	AUX
fcis-15176	6	14	two	two	NUM
fcis-15176	6	15	commonly	commonly	ADV
fcis-15176	6	16	used	use	VERB
fcis-15176	6	17	algorithms	algorithm	NOUN
fcis-15176	6	18	in	in	ADP
fcis-15176	6	19	algorithm	algorithm	NOUN
fcis-15176	6	20	design	design	NOUN
fcis-15176	6	21	.	.	PUNCT
fcis-15176	7	1	the	the	DET
fcis-15176	7	2	greedy	greedy	ADJ
fcis-15176	7	3	algorithm	algorithm	NOUN
fcis-15176	7	4	only	only	ADV
fcis-15176	7	5	considers	consider	VERB
fcis-15176	7	6	the	the	DET
fcis-15176	7	7	optimal	optimal	ADJ
fcis-15176	7	8	solution	solution	NOUN
fcis-15176	7	9	in	in	ADP
fcis-15176	7	10	the	the	DET
fcis-15176	7	11	current	current	ADJ
fcis-15176	7	12	state	state	NOUN
fcis-15176	7	13	and	and	CCONJ
fcis-15176	7	14	can	can	AUX
fcis-15176	7	15	not	not	PART
fcis-15176	7	16	guarantee	guarantee	VERB
fcis-15176	7	17	the	the	DET
fcis-15176	7	18	global	global	ADJ
fcis-15176	7	19	optimal	optimal	ADJ
fcis-15176	7	20	solution	solution	NOUN
fcis-15176	7	21	,	,	PUNCT
fcis-15176	7	22	while	while	SCONJ
fcis-15176	7	23	the	the	DET
fcis-15176	7	24	dynamic	dynamic	ADJ
fcis-15176	7	25	programming	programming	NOUN
fcis-15176	7	26	algorithm	algorithm	NOUN
fcis-15176	7	27	can	can	AUX
fcis-15176	7	28	guarantee	guarantee	VERB
fcis-15176	7	29	the	the	DET
fcis-15176	7	30	global	global	ADJ
fcis-15176	7	31	optimal	optimal	ADJ
fcis-15176	7	32	solution	solution	NOUN
fcis-15176	7	33	by	by	ADP
fcis-15176	7	34	decomposing	decompose	VERB
fcis-15176	7	35	the	the	DET
fcis-15176	7	36	problem	problem	NOUN
fcis-15176	7	37	into	into	ADP
fcis-15176	7	38	many	many	ADJ
fcis-15176	7	39	overlapping	overlap	VERB
fcis-15176	7	40	subproblems	subproblem	NOUN
fcis-15176	7	41	and	and	CCONJ
fcis-15176	7	42	using	use	VERB
fcis-15176	7	43	the	the	DET
fcis-15176	7	44	optimal	optimal	ADJ
fcis-15176	7	45	substructure	substructure	NOUN
fcis-15176	7	46	algorithm	algorithm	NOUN
fcis-15176	7	47	.	.	PUNCT
fcis-15176	8	1	selecting	select	VERB
fcis-15176	8	2	different	different	ADJ
fcis-15176	8	3	algorithms	algorithm	NOUN
fcis-15176	8	4	for	for	ADP
fcis-15176	8	5	different	different	ADJ
fcis-15176	8	6	problems	problem	NOUN
fcis-15176	8	7	can	can	AUX
fcis-15176	8	8	optimize	optimize	VERB
fcis-15176	8	9	the	the	DET
fcis-15176	8	10	efficiency	efficiency	NOUN
fcis-15176	8	11	of	of	ADP
fcis-15176	8	12	the	the	DET
fcis-15176	8	13	algorithm	algorithm	NOUN
fcis-15176	8	14	,	,	PUNCT
fcis-15176	8	15	improve	improve	VERB
fcis-15176	8	16	the	the	DET
fcis-15176	8	17	running	run	VERB
fcis-15176	8	18	speed	speed	NOUN
fcis-15176	8	19	of	of	ADP
fcis-15176	8	20	the	the	DET
fcis-15176	8	21	program	program	NOUN
fcis-15176	8	22	,	,	PUNCT
fcis-15176	8	23	and	and	CCONJ
fcis-15176	8	24	make	make	VERB
fcis-15176	8	25	the	the	DET
fcis-15176	8	26	program	program	NOUN
fcis-15176	8	27	better	well	ADV
fcis-15176	8	28	serve	serve	VERB
fcis-15176	8	29	the	the	DET
fcis-15176	8	30	practical	practical	ADJ
fcis-15176	8	31	applications	application	NOUN
fcis-15176	8	32	.	.	PUNCT
fcis-15176	9	1	and	and	CCONJ
fcis-15176	9	2	python	python	PROPN
fcis-15176	9	3	,	,	PUNCT
fcis-15176	9	4	as	as	ADP
fcis-15176	9	5	a	a	DET
fcis-15176	9	6	simple	simple	ADJ
fcis-15176	9	7	and	and	CCONJ
fcis-15176	9	8	easy	easy	ADJ
fcis-15176	9	9	-	-	PUNCT
fcis-15176	9	10	to	to	PART
fcis-15176	9	11	-	-	PUNCT
fcis-15176	9	12	learn	learn	VERB
fcis-15176	9	13	programming	programming	NOUN
fcis-15176	9	14	language	language	NOUN
fcis-15176	9	15	,	,	PUNCT
fcis-15176	9	16	provides	provide	VERB
fcis-15176	9	17	a	a	DET
fcis-15176	9	18	very	very	ADV
fcis-15176	9	19	convenient	convenient	ADJ
fcis-15176	9	20	way	way	NOUN
fcis-15176	9	21	for	for	ADP
fcis-15176	9	22	algorithm	algorithm	NOUN
fcis-15176	9	23	design	design	NOUN
fcis-15176	9	24	.	.	PUNCT
fcis-15176	10	1	2	2	X
fcis-15176	10	2	.	.	X
fcis-15176	10	3	greedy	greedy	ADJ
fcis-15176	10	4	algorithms	algorithm	NOUN
fcis-15176	10	5	a	a	DET
fcis-15176	10	6	greedy	greedy	ADJ
fcis-15176	10	7	algorithm	algorithm	NOUN
fcis-15176	10	8	is	be	AUX
fcis-15176	10	9	an	an	DET
fcis-15176	10	10	algorithm	algorithm	NOUN
fcis-15176	10	11	that	that	PRON
fcis-15176	10	12	focuses	focus	VERB
fcis-15176	10	13	only	only	ADV
fcis-15176	10	14	on	on	ADP
fcis-15176	10	15	the	the	DET
fcis-15176	10	16	local	local	ADJ
fcis-15176	10	17	optimum	optimum	NOUN
fcis-15176	10	18	and	and	CCONJ
fcis-15176	10	19	then	then	ADV
fcis-15176	10	20	approximates	approximate	VERB
fcis-15176	10	21	the	the	DET
fcis-15176	10	22	global	global	ADJ
fcis-15176	10	23	locally	locally	ADV
fcis-15176	10	24	[	[	X
fcis-15176	10	25	1	1	NUM
fcis-15176	10	26	]	]	PUNCT
fcis-15176	10	27	.	.	PUNCT
fcis-15176	11	1	however	however	ADV
fcis-15176	11	2	,	,	PUNCT
fcis-15176	11	3	the	the	DET
fcis-15176	11	4	solution	solution	NOUN
fcis-15176	11	5	obtained	obtain	VERB
fcis-15176	11	6	using	use	VERB
fcis-15176	11	7	the	the	DET
fcis-15176	11	8	greedy	greedy	ADJ
fcis-15176	11	9	algorithm	algorithm	NOUN
fcis-15176	11	10	is	be	AUX
fcis-15176	11	11	not	not	PART
fcis-15176	11	12	always	always	ADV
fcis-15176	11	13	the	the	DET
fcis-15176	11	14	global	global	ADJ
fcis-15176	11	15	optimal	optimal	ADJ
fcis-15176	11	16	solution	solution	NOUN
fcis-15176	11	17	,	,	PUNCT
fcis-15176	11	18	it	it	PRON
fcis-15176	11	19	depends	depend	VERB
fcis-15176	11	20	on	on	ADP
fcis-15176	11	21	the	the	DET
fcis-15176	11	22	original	original	ADJ
fcis-15176	11	23	problem	problem	NOUN
fcis-15176	11	24	and	and	CCONJ
fcis-15176	11	25	the	the	DET
fcis-15176	11	26	greedy	greedy	ADJ
fcis-15176	11	27	strategy	strategy	NOUN
fcis-15176	11	28	used	use	VERB
fcis-15176	11	29	.	.	PUNCT
fcis-15176	12	1	therefore	therefore	ADV
fcis-15176	12	2	,	,	PUNCT
fcis-15176	12	3	when	when	SCONJ
fcis-15176	12	4	solving	solve	VERB
fcis-15176	12	5	real	real	ADJ
fcis-15176	12	6	-	-	PUNCT
fcis-15176	12	7	world	world	NOUN
fcis-15176	12	8	problems	problem	NOUN
fcis-15176	12	9	,	,	PUNCT
fcis-15176	12	10	we	we	PRON
fcis-15176	12	11	need	need	VERB
fcis-15176	12	12	to	to	PART
fcis-15176	12	13	make	make	VERB
fcis-15176	12	14	a	a	DET
fcis-15176	12	15	judgment	judgment	NOUN
fcis-15176	12	16	on	on	ADP
fcis-15176	12	17	whether	whether	SCONJ
fcis-15176	12	18	the	the	DET
fcis-15176	12	19	current	current	ADJ
fcis-15176	12	20	problem	problem	NOUN
fcis-15176	12	21	can	can	AUX
fcis-15176	12	22	be	be	AUX
fcis-15176	12	23	solved	solve	VERB
fcis-15176	12	24	using	use	VERB
fcis-15176	12	25	a	a	DET
fcis-15176	12	26	greedy	greedy	ADJ
fcis-15176	12	27	strategy	strategy	NOUN
fcis-15176	12	28	.	.	PUNCT
fcis-15176	13	1	that	that	PRON
fcis-15176	13	2	is	be	AUX
fcis-15176	13	3	,	,	PUNCT
fcis-15176	13	4	although	although	SCONJ
fcis-15176	13	5	they	they	PRON
fcis-15176	13	6	are	be	AUX
fcis-15176	13	7	both	both	PRON
fcis-15176	13	8	greedy	greedy	ADJ
fcis-15176	13	9	algorithms	algorithm	NOUN
fcis-15176	13	10	,	,	PUNCT
fcis-15176	13	11	their	their	PRON
fcis-15176	13	12	strategies	strategy	NOUN
fcis-15176	13	13	may	may	AUX
fcis-15176	13	14	be	be	AUX
fcis-15176	13	15	different	different	ADJ
fcis-15176	13	16	.	.	PUNCT
fcis-15176	14	1	when	when	SCONJ
fcis-15176	14	2	solving	solve	VERB
fcis-15176	14	3	a	a	DET
fcis-15176	14	4	problem	problem	NOUN
fcis-15176	14	5	,	,	PUNCT
fcis-15176	14	6	the	the	DET
fcis-15176	14	7	greedy	greedy	ADJ
fcis-15176	14	8	strategy	strategy	NOUN
fcis-15176	14	9	chosen	choose	VERB
fcis-15176	14	10	must	must	AUX
fcis-15176	14	11	be	be	AUX
fcis-15176	14	12	free	free	ADJ
fcis-15176	14	13	of	of	ADP
fcis-15176	14	14	a	a	DET
fcis-15176	14	15	posteriori	posteriori	NOUN
fcis-15176	14	16	effects	effect	NOUN
fcis-15176	14	17	,	,	PUNCT
fcis-15176	14	18	i.e.	i.e.	X
fcis-15176	14	19	,	,	PUNCT
fcis-15176	14	20	each	each	DET
fcis-15176	14	21	process	process	NOUN
fcis-15176	14	22	is	be	AUX
fcis-15176	14	23	independent	independent	ADJ
fcis-15176	14	24	of	of	ADP
fcis-15176	14	25	the	the	DET
fcis-15176	14	26	other	other	ADJ
fcis-15176	14	27	and	and	CCONJ
fcis-15176	14	28	has	have	VERB
fcis-15176	14	29	no	no	DET
fcis-15176	14	30	influence	influence	NOUN
fcis-15176	14	31	on	on	ADP
fcis-15176	14	32	the	the	DET
fcis-15176	14	33	previous	previous	ADJ
fcis-15176	14	34	and	and	CCONJ
fcis-15176	14	35	subsequent	subsequent	ADJ
fcis-15176	14	36	ones	one	NOUN
fcis-15176	15	1	[	[	X
fcis-15176	15	2	2	2	NUM
fcis-15176	15	3	]	]	PUNCT
fcis-15176	15	4	.	.	PUNCT
fcis-15176	16	1	although	although	SCONJ
fcis-15176	16	2	greedy	greedy	ADJ
fcis-15176	16	3	algorithms	algorithm	NOUN
fcis-15176	16	4	sometimes	sometimes	ADV
fcis-15176	16	5	do	do	AUX
fcis-15176	16	6	not	not	PART
fcis-15176	16	7	lead	lead	VERB
fcis-15176	16	8	to	to	ADP
fcis-15176	16	9	an	an	DET
fcis-15176	16	10	optimal	optimal	ADJ
fcis-15176	16	11	solution	solution	NOUN
fcis-15176	16	12	but	but	CCONJ
fcis-15176	16	13	to	to	ADP
fcis-15176	16	14	a	a	DET
fcis-15176	16	15	near	near	ADV
fcis-15176	16	16	-	-	PUNCT
fcis-15176	16	17	optimal	optimal	ADJ
fcis-15176	16	18	solution	solution	NOUN
fcis-15176	16	19	,	,	PUNCT
fcis-15176	16	20	they	they	PRON
fcis-15176	16	21	can	can	AUX
fcis-15176	16	22	greatly	greatly	ADV
fcis-15176	16	23	improve	improve	VERB
fcis-15176	16	24	the	the	DET
fcis-15176	16	25	efficiency	efficiency	NOUN
fcis-15176	16	26	of	of	ADP
fcis-15176	16	27	our	our	PRON
fcis-15176	16	28	solution	solution	NOUN
fcis-15176	16	29	within	within	ADP
fcis-15176	16	30	the	the	DET
fcis-15176	16	31	error	error	NOUN
fcis-15176	16	32	margin	margin	NOUN
fcis-15176	16	33	[	[	X
fcis-15176	16	34	3	3	NUM
fcis-15176	16	35	]	]	PUNCT
fcis-15176	16	36	.	.	PUNCT
fcis-15176	17	1	the	the	DET
fcis-15176	17	2	general	general	ADJ
fcis-15176	17	3	steps	step	NOUN
fcis-15176	17	4	for	for	ADP
fcis-15176	17	5	applying	apply	VERB
fcis-15176	17	6	the	the	DET
fcis-15176	17	7	greedy	greedy	ADJ
fcis-15176	17	8	algorithm	algorithm	NOUN
fcis-15176	17	9	to	to	PART
fcis-15176	17	10	solve	solve	VERB
fcis-15176	17	11	a	a	DET
fcis-15176	17	12	problem	problem	NOUN
fcis-15176	17	13	are	be	AUX
fcis-15176	17	14	:	:	PUNCT
fcis-15176	17	15	(	(	PUNCT
fcis-15176	17	16	1	1	X
fcis-15176	17	17	)	)	PUNCT
fcis-15176	17	18	set	set	VERB
fcis-15176	17	19	up	up	ADP
fcis-15176	17	20	a	a	DET
fcis-15176	17	21	model	model	NOUN
fcis-15176	17	22	to	to	PART
fcis-15176	17	23	describe	describe	VERB
fcis-15176	17	24	the	the	DET
fcis-15176	17	25	problem	problem	NOUN
fcis-15176	17	26	.	.	PUNCT
fcis-15176	18	1	(	(	PUNCT
fcis-15176	18	2	2	2	X
fcis-15176	18	3	)	)	PUNCT
fcis-15176	18	4	divide	divide	VERB
fcis-15176	18	5	the	the	DET
fcis-15176	18	6	original	original	ADJ
fcis-15176	18	7	problem	problem	NOUN
fcis-15176	18	8	into	into	ADP
fcis-15176	18	9	subproblems	subproblem	NOUN
fcis-15176	18	10	.	.	PUNCT
fcis-15176	19	1	(	(	PUNCT
fcis-15176	19	2	3	3	X
fcis-15176	19	3	)	)	PUNCT
fcis-15176	19	4	solve	solve	VERB
fcis-15176	19	5	each	each	DET
fcis-15176	19	6	subproblem	subproblem	NOUN
fcis-15176	19	7	,	,	PUNCT
fcis-15176	19	8	resulting	result	VERB
fcis-15176	19	9	in	in	ADP
fcis-15176	19	10	a	a	DET
fcis-15176	19	11	locally	locally	ADV
fcis-15176	19	12	optimal	optimal	ADJ
fcis-15176	19	13	solution	solution	NOUN
fcis-15176	19	14	to	to	ADP
fcis-15176	19	15	the	the	DET
fcis-15176	19	16	subproblem	subproblem	NOUN
fcis-15176	19	17	.	.	PUNCT
fcis-15176	20	1	(	(	PUNCT
fcis-15176	20	2	4	4	X
fcis-15176	20	3	)	)	PUNCT
fcis-15176	20	4	combine	combine	VERB
fcis-15176	20	5	the	the	DET
fcis-15176	20	6	local	local	ADJ
fcis-15176	20	7	optimal	optimal	ADJ
fcis-15176	20	8	solutions	solution	NOUN
fcis-15176	20	9	of	of	ADP
fcis-15176	20	10	the	the	DET
fcis-15176	20	11	subproblems	subproblem	NOUN
fcis-15176	20	12	into	into	ADP
fcis-15176	20	13	the	the	DET
fcis-15176	20	14	solution	solution	NOUN
fcis-15176	20	15	of	of	ADP
fcis-15176	20	16	the	the	DET
fcis-15176	20	17	original	original	ADJ
fcis-15176	20	18	problem	problem	NOUN
fcis-15176	20	19	.	.	PUNCT
fcis-15176	21	1	example	example	NOUN
fcis-15176	21	2	topic	topic	NOUN
fcis-15176	21	3	:	:	PUNCT
fcis-15176	21	4	shortest	short	ADJ
fcis-15176	21	5	path	path	NOUN
fcis-15176	21	6	problem	problem	NOUN
fcis-15176	21	7	.	.	PUNCT
fcis-15176	22	1	given	give	VERB
fcis-15176	22	2	a	a	DET
fcis-15176	22	3	directed	direct	VERB
fcis-15176	22	4	acyclic	acyclic	ADJ
fcis-15176	22	5	graph	graph	NOUN
fcis-15176	22	6	dag	dag	PROPN
fcis-15176	22	7	,	,	PUNCT
fcis-15176	22	8	and	and	CCONJ
fcis-15176	22	9	the	the	DET
fcis-15176	22	10	weights	weight	NOUN
fcis-15176	22	11	of	of	ADP
fcis-15176	22	12	each	each	DET
fcis-15176	22	13	edge	edge	NOUN
fcis-15176	22	14	,	,	PUNCT
fcis-15176	22	15	find	find	VERB
fcis-15176	22	16	the	the	DET
fcis-15176	22	17	shortest	short	ADJ
fcis-15176	22	18	path	path	NOUN
fcis-15176	22	19	from	from	ADP
fcis-15176	22	20	the	the	DET
fcis-15176	22	21	origin	origin	NOUN
fcis-15176	22	22	s	s	VERB
fcis-15176	22	23	to	to	ADP
fcis-15176	22	24	each	each	DET
fcis-15176	22	25	point	point	NOUN
fcis-15176	22	26	,	,	PUNCT
fcis-15176	22	27	as	as	SCONJ
fcis-15176	22	28	shown	show	VERB
fcis-15176	22	29	in	in	ADP
fcis-15176	22	30	figure	figure	NOUN
fcis-15176	22	31	1	1	NUM
fcis-15176	22	32	.	.	PUNCT
fcis-15176	22	33	figure	figure	NOUN
fcis-15176	22	34	1	1	NUM
fcis-15176	22	35	.	.	PUNCT
fcis-15176	22	36	directed	direct	VERB
fcis-15176	22	37	acyclic	acyclic	ADJ
fcis-15176	22	38	graph	graph	NOUN
fcis-15176	22	39	example	example	NOUN
fcis-15176	22	40	problem	problem	NOUN
fcis-15176	22	41	analysis	analysis	NOUN
fcis-15176	22	42	:	:	PUNCT
fcis-15176	22	43	(	(	PUNCT
fcis-15176	22	44	1	1	X
fcis-15176	22	45	)	)	PUNCT
fcis-15176	22	46	first	first	ADV
fcis-15176	23	1	,	,	PUNCT
fcis-15176	23	2	we	we	PRON
fcis-15176	23	3	set	set	VERB
fcis-15176	23	4	the	the	DET
fcis-15176	23	5	shortest	short	ADJ
fcis-15176	23	6	distance	distance	NOUN
fcis-15176	23	7	to	to	ADP
fcis-15176	23	8	each	each	DET
fcis-15176	23	9	point	point	NOUN
fcis-15176	23	10	as	as	ADP
fcis-15176	23	11	d(x	d(x	PROPN
fcis-15176	23	12	)	)	PUNCT
fcis-15176	23	13	starting	start	VERB
fcis-15176	23	14	at	at	ADP
fcis-15176	23	15	point	point	NOUN
fcis-15176	23	16	s	s	PROPN
fcis-15176	23	17	,	,	PUNCT
fcis-15176	23	18	where	where	SCONJ
fcis-15176	23	19	d(s)=0	d(s)=0	NUM
fcis-15176	23	20	and	and	CCONJ
fcis-15176	23	21	the	the	DET
fcis-15176	23	22	d	d	PROPN
fcis-15176	23	23	values	value	NOUN
fcis-15176	23	24	of	of	ADP
fcis-15176	23	25	the	the	DET
fcis-15176	23	26	remaining	remain	VERB
fcis-15176	23	27	points	point	NOUN
fcis-15176	23	28	are	be	AUX
fcis-15176	23	29	set	set	VERB
fcis-15176	23	30	to	to	PART
fcis-15176	23	31	inf	inf	VERB
fcis-15176	23	32	.	.	PUNCT
fcis-15176	24	1	and	and	CCONJ
fcis-15176	24	2	use	use	VERB
fcis-15176	24	3	an	an	DET
fcis-15176	24	4	array	array	NOUN
fcis-15176	24	5	to	to	PART
fcis-15176	24	6	record	record	VERB
fcis-15176	24	7	whether	whether	SCONJ
fcis-15176	24	8	the	the	DET
fcis-15176	24	9	current	current	ADJ
fcis-15176	24	10	node	node	NOUN
fcis-15176	24	11	has	have	AUX
fcis-15176	24	12	been	be	AUX
fcis-15176	24	13	visited	visit	VERB
fcis-15176	24	14	or	or	CCONJ
fcis-15176	24	15	not	not	PART
fcis-15176	24	16	.	.	PUNCT
fcis-15176	25	1	(	(	PUNCT
fcis-15176	25	2	2	2	X
fcis-15176	25	3	)	)	PUNCT
fcis-15176	25	4	pick	pick	VERB
fcis-15176	25	5	a	a	DET
fcis-15176	25	6	node	node	NOUN
fcis-15176	25	7	with	with	ADP
fcis-15176	25	8	the	the	DET
fcis-15176	25	9	smallest	small	ADJ
fcis-15176	25	10	d	d	NOUN
fcis-15176	25	11	value	value	NOUN
fcis-15176	25	12	from	from	ADP
fcis-15176	25	13	the	the	DET
fcis-15176	25	14	unvisited	unvisited	ADJ
fcis-15176	25	15	nodes	node	NOUN
fcis-15176	25	16	,	,	PUNCT
fcis-15176	25	17	traverse	traverse	VERB
fcis-15176	25	18	all	all	DET
fcis-15176	25	19	the	the	DET
fcis-15176	25	20	edges	edge	NOUN
fcis-15176	25	21	starting	start	VERB
fcis-15176	25	22	from	from	ADP
fcis-15176	25	23	it	it	PRON
fcis-15176	25	24	and	and	CCONJ
fcis-15176	25	25	update	update	VERB
fcis-15176	25	26	the	the	DET
fcis-15176	25	27	d	d	PROPN
fcis-15176	25	28	value	value	NOUN
fcis-15176	25	29	at	at	ADP
fcis-15176	25	30	the	the	DET
fcis-15176	25	31	end	end	NOUN
fcis-15176	25	32	of	of	ADP
fcis-15176	25	33	the	the	DET
fcis-15176	25	34	edge	edge	NOUN
fcis-15176	25	35	and	and	CCONJ
fcis-15176	25	36	set	set	VERB
fcis-15176	25	37	the	the	DET
fcis-15176	25	38	current	current	ADJ
fcis-15176	25	39	node	node	NOUN
fcis-15176	25	40	as	as	SCONJ
fcis-15176	25	41	visited	visit	VERB
fcis-15176	25	42	.	.	PUNCT
fcis-15176	26	1	(	(	PUNCT
fcis-15176	26	2	3	3	X
fcis-15176	26	3	)	)	PUNCT
fcis-15176	26	4	repeat	repeat	NOUN
fcis-15176	26	5	step	step	NOUN
fcis-15176	26	6	(	(	PUNCT
fcis-15176	26	7	2	2	NUM
fcis-15176	26	8	)	)	PUNCT
fcis-15176	26	9	until	until	SCONJ
fcis-15176	26	10	all	all	DET
fcis-15176	26	11	nodes	node	NOUN
fcis-15176	26	12	have	have	AUX
fcis-15176	26	13	been	be	AUX
fcis-15176	26	14	visited	visit	VERB
fcis-15176	26	15	or	or	CCONJ
fcis-15176	26	16	the	the	DET
fcis-15176	26	17	d	d	PROPN
fcis-15176	26	18	values	value	NOUN
fcis-15176	26	19	of	of	ADP
fcis-15176	26	20	the	the	DET
fcis-15176	26	21	unvisited	unvisited	ADJ
fcis-15176	26	22	nodes	node	NOUN
fcis-15176	26	23	are	be	AUX
fcis-15176	26	24	inf	inf	ADJ
fcis-15176	26	25	.	.	PUNCT
fcis-15176	27	1	(	(	PUNCT
fcis-15176	27	2	4	4	X
fcis-15176	27	3	)	)	PUNCT
fcis-15176	27	4	each	each	DET
fcis-15176	27	5	time	time	NOUN
fcis-15176	27	6	we	we	PRON
fcis-15176	27	7	pick	pick	VERB
fcis-15176	27	8	one	one	NUM
fcis-15176	27	9	of	of	ADP
fcis-15176	27	10	the	the	DET
fcis-15176	27	11	unvisited	unvisited	ADJ
fcis-15176	27	12	nodes	node	NOUN
fcis-15176	27	13	with	with	ADP
fcis-15176	27	14	the	the	DET
fcis-15176	27	15	smallest	small	ADJ
fcis-15176	27	16	d	d	NOUN
fcis-15176	27	17	-	-	NOUN
fcis-15176	27	18	value	value	NOUN
fcis-15176	27	19	to	to	PART
fcis-15176	27	20	use	use	VERB
fcis-15176	27	21	it	it	PRON
fcis-15176	27	22	to	to	PART
fcis-15176	27	23	update	update	VERB
fcis-15176	27	24	the	the	DET
fcis-15176	27	25	shortest	short	ADJ
fcis-15176	27	26	path	path	NOUN
fcis-15176	27	27	to	to	ADP
fcis-15176	27	28	other	other	ADJ
fcis-15176	27	29	nodes	node	NOUN
fcis-15176	27	30	,	,	PUNCT
fcis-15176	27	31	even	even	ADV
fcis-15176	27	32	if	if	SCONJ
fcis-15176	27	33	the	the	DET
fcis-15176	27	34	subsequent	subsequent	ADJ
fcis-15176	27	35	visited	visit	VERB
fcis-15176	27	36	nodes	node	NOUN
fcis-15176	27	37	have	have	VERB
fcis-15176	27	38	paths	path	NOUN
fcis-15176	27	39	to	to	PART
fcis-15176	27	40	reach	reach	VERB
fcis-15176	27	41	the	the	DET
fcis-15176	27	42	current	current	ADJ
fcis-15176	27	43	point	point	NOUN
fcis-15176	27	44	but	but	CCONJ
fcis-15176	27	45	the	the	DET
fcis-15176	27	46	distance	distance	NOUN
fcis-15176	27	47	from	from	ADP
fcis-15176	27	48	that	that	DET
fcis-15176	27	49	point	point	NOUN
fcis-15176	27	50	to	to	ADP
fcis-15176	27	51	the	the	DET
fcis-15176	27	52	current	current	ADJ
fcis-15176	27	53	point	point	NOUN
fcis-15176	27	54	must	must	AUX
fcis-15176	27	55	not	not	PART
fcis-15176	27	56	be	be	AUX
fcis-15176	27	57	less	less	ADJ
fcis-15176	27	58	than	than	ADP
fcis-15176	27	59	the	the	DET
fcis-15176	27	60	d	d	NOUN
fcis-15176	27	61	-	-	NOUN
fcis-15176	27	62	value	value	NOUN
fcis-15176	27	63	of	of	ADP
fcis-15176	27	64	the	the	DET
fcis-15176	27	65	current	current	ADJ
fcis-15176	27	66	point	point	NOUN
fcis-15176	27	67	.	.	PUNCT
fcis-15176	28	1	(	(	PUNCT
fcis-15176	28	2	5	5	NUM
fcis-15176	28	3	)	)	PUNCT
fcis-15176	28	4	under	under	ADP
fcis-15176	28	5	the	the	DET
fcis-15176	28	6	condition	condition	NOUN
fcis-15176	28	7	of	of	ADP
fcis-15176	28	8	satisfying	satisfy	VERB
fcis-15176	28	9	(	(	PUNCT
fcis-15176	28	10	4	4	X
fcis-15176	28	11	)	)	PUNCT
fcis-15176	28	12	we	we	PRON
fcis-15176	28	13	can	can	AUX
fcis-15176	28	14	determine	determine	VERB
fcis-15176	28	15	the	the	DET
fcis-15176	28	16	minimum	minimum	ADJ
fcis-15176	28	17	value	value	NOUN
fcis-15176	28	18	of	of	ADP
fcis-15176	28	19	arriving	arrive	VERB
fcis-15176	28	20	at	at	ADP
fcis-15176	28	21	a	a	DET
fcis-15176	28	22	point	point	NOUN
fcis-15176	28	23	each	each	DET
fcis-15176	28	24	time	time	NOUN
fcis-15176	28	25	,	,	PUNCT
fcis-15176	28	26	and	and	CCONJ
fcis-15176	28	27	after	after	ADP
fcis-15176	28	28	n	n	PRON
fcis-15176	28	29	layers	layer	NOUN
fcis-15176	28	30	of	of	ADP
fcis-15176	28	31	loops	loop	NOUN
fcis-15176	28	32	we	we	PRON
fcis-15176	28	33	can	can	AUX
fcis-15176	28	34	get	get	VERB
fcis-15176	28	35	the	the	DET
fcis-15176	28	36	shortest	short	ADJ
fcis-15176	28	37	distance	distance	NOUN
fcis-15176	28	38	from	from	ADP
fcis-15176	28	39	point	point	NOUN
fcis-15176	28	40	s	s	PROPN
fcis-15176	28	41	to	to	ADP
fcis-15176	28	42	all	all	DET
fcis-15176	28	43	the	the	DET
fcis-15176	28	44	points	point	NOUN
fcis-15176	28	45	,	,	PUNCT
fcis-15176	28	46	with	with	ADP
fcis-15176	28	47	a	a	DET
fcis-15176	28	48	time	time	NOUN
fcis-15176	28	49	complexity	complexity	NOUN
fcis-15176	28	50	of	of	ADP
fcis-15176	28	51	o	o	PROPN
fcis-15176	28	52	(	(	PUNCT
fcis-15176	28	53	)	)	PUNCT
fcis-15176	28	54	.	.	PUNCT
fcis-15176	29	1	the	the	DET
fcis-15176	29	2	program	program	NOUN
fcis-15176	29	3	and	and	CCONJ
fcis-15176	29	4	running	running	NOUN
fcis-15176	29	5	results	result	NOUN
fcis-15176	29	6	are	be	AUX
fcis-15176	29	7	shown	show	VERB
fcis-15176	29	8	in	in	ADP
fcis-15176	29	9	figure	figure	NOUN
fcis-15176	29	10	2	2	NUM
fcis-15176	29	11	:	:	PUNCT
fcis-15176	29	12	53	53	NUM
fcis-15176	29	13	figure	figure	NOUN
fcis-15176	29	14	2	2	NUM
fcis-15176	29	15	.	.	PUNCT
fcis-15176	30	1	dijkstra	dijkstra	PROPN
fcis-15176	30	2	's	's	PART
fcis-15176	30	3	algorithm	algorithm	NOUN
fcis-15176	30	4	considerations	consideration	NOUN
fcis-15176	30	5	for	for	ADP
fcis-15176	30	6	using	use	VERB
fcis-15176	30	7	the	the	DET
fcis-15176	30	8	greedy	greedy	ADJ
fcis-15176	30	9	algorithm	algorithm	NOUN
fcis-15176	30	10	:	:	PUNCT
fcis-15176	30	11	(	(	PUNCT
fcis-15176	30	12	1	1	X
fcis-15176	30	13	)	)	PUNCT
fcis-15176	30	14	the	the	DET
fcis-15176	30	15	greedy	greedy	ADJ
fcis-15176	30	16	algorithm	algorithm	NOUN
fcis-15176	30	17	does	do	AUX
fcis-15176	30	18	not	not	PART
fcis-15176	30	19	consider	consider	VERB
fcis-15176	30	20	the	the	DET
fcis-15176	30	21	overall	overall	ADJ
fcis-15176	30	22	optimality	optimality	NOUN
fcis-15176	30	23	of	of	ADP
fcis-15176	30	24	the	the	DET
fcis-15176	30	25	problem	problem	NOUN
fcis-15176	30	26	,	,	PUNCT
fcis-15176	30	27	but	but	CCONJ
fcis-15176	30	28	only	only	ADV
fcis-15176	30	29	chooses	choose	VERB
fcis-15176	30	30	some	some	DET
fcis-15176	30	31	sense	sense	NOUN
fcis-15176	30	32	of	of	ADP
fcis-15176	30	33	local	local	ADJ
fcis-15176	30	34	optimality	optimality	NOUN
fcis-15176	30	35	[	[	X
fcis-15176	30	36	4	4	NUM
fcis-15176	30	37	]	]	PUNCT
fcis-15176	30	38	,	,	PUNCT
fcis-15176	30	39	so	so	CCONJ
fcis-15176	30	40	the	the	DET
fcis-15176	30	41	results	result	NOUN
fcis-15176	30	42	obtained	obtain	VERB
fcis-15176	30	43	by	by	ADP
fcis-15176	30	44	the	the	DET
fcis-15176	30	45	greedy	greedy	ADJ
fcis-15176	30	46	algorithm	algorithm	NOUN
fcis-15176	30	47	are	be	AUX
fcis-15176	30	48	not	not	PART
fcis-15176	30	49	necessarily	necessarily	ADV
fcis-15176	30	50	correct	correct	ADJ
fcis-15176	30	51	.	.	PUNCT
fcis-15176	31	1	(	(	PUNCT
fcis-15176	31	2	2	2	X
fcis-15176	31	3	)	)	PUNCT
fcis-15176	31	4	any	any	DET
fcis-15176	31	5	topic	topic	NOUN
fcis-15176	31	6	that	that	PRON
fcis-15176	31	7	requires	require	VERB
fcis-15176	31	8	consideration	consideration	NOUN
fcis-15176	31	9	of	of	ADP
fcis-15176	31	10	previously	previously	ADV
fcis-15176	31	11	taken	take	VERB
fcis-15176	31	12	steps	step	NOUN
fcis-15176	31	13	or	or	CCONJ
fcis-15176	31	14	paths	path	NOUN
fcis-15176	31	15	is	be	AUX
fcis-15176	31	16	not	not	PART
fcis-15176	31	17	suitable	suitable	ADJ
fcis-15176	31	18	for	for	ADP
fcis-15176	31	19	the	the	DET
fcis-15176	31	20	use	use	NOUN
fcis-15176	31	21	of	of	ADP
fcis-15176	31	22	greedy	greedy	ADJ
fcis-15176	31	23	algorithms	algorithm	NOUN
fcis-15176	31	24	.	.	PUNCT
fcis-15176	32	1	(	(	PUNCT
fcis-15176	32	2	3	3	X
fcis-15176	32	3	)	)	PUNCT
fcis-15176	32	4	the	the	DET
fcis-15176	32	5	use	use	NOUN
fcis-15176	32	6	of	of	ADP
fcis-15176	32	7	greedy	greedy	ADJ
fcis-15176	32	8	algorithms	algorithm	NOUN
fcis-15176	32	9	needs	need	VERB
fcis-15176	32	10	to	to	PART
fcis-15176	32	11	be	be	AUX
fcis-15176	32	12	proven	prove	VERB
fcis-15176	32	13	by	by	ADP
fcis-15176	32	14	reasoning	reason	VERB
fcis-15176	32	15	at	at	ADP
fcis-15176	32	16	the	the	DET
fcis-15176	32	17	mathematical	mathematical	ADJ
fcis-15176	32	18	level	level	NOUN
fcis-15176	32	19	,	,	PUNCT
fcis-15176	32	20	otherwise	otherwise	ADV
fcis-15176	32	21	the	the	DET
fcis-15176	32	22	greedy	greedy	ADJ
fcis-15176	32	23	algorithm	algorithm	NOUN
fcis-15176	32	24	adopted	adopt	VERB
fcis-15176	32	25	is	be	AUX
fcis-15176	32	26	not	not	PART
fcis-15176	32	27	always	always	ADV
fcis-15176	32	28	correct	correct	ADJ
fcis-15176	32	29	.	.	PUNCT
fcis-15176	33	1	3	3	X
fcis-15176	33	2	.	.	X
fcis-15176	33	3	dynamic	dynamic	ADJ
fcis-15176	33	4	planning	planning	NOUN
fcis-15176	33	5	algorithm	algorithm	NOUN
fcis-15176	33	6	dynamic	dynamic	ADJ
fcis-15176	33	7	programming	programming	NOUN
fcis-15176	33	8	algorithm	algorithm	NOUN
fcis-15176	33	9	is	be	AUX
fcis-15176	33	10	an	an	DET
fcis-15176	33	11	effective	effective	ADJ
fcis-15176	33	12	method	method	NOUN
fcis-15176	33	13	suitable	suitable	ADJ
fcis-15176	33	14	for	for	ADP
fcis-15176	33	15	solving	solve	VERB
fcis-15176	33	16	overlapping	overlap	VERB
fcis-15176	33	17	subproblems	subproblem	NOUN
fcis-15176	33	18	and	and	CCONJ
fcis-15176	33	19	optimal	optimal	ADJ
fcis-15176	33	20	substructure	substructure	NOUN
fcis-15176	33	21	problems	problem	NOUN
fcis-15176	33	22	created	create	VERB
fcis-15176	33	23	by	by	ADP
fcis-15176	33	24	the	the	DET
fcis-15176	33	25	american	american	ADJ
fcis-15176	33	26	mathematician	mathematician	ADJ
fcis-15176	33	27	bellman	bellman	NOUN
fcis-15176	33	28	in	in	ADP
fcis-15176	33	29	the	the	DET
fcis-15176	33	30	study	study	NOUN
fcis-15176	33	31	of	of	ADP
fcis-15176	33	32	optimization	optimization	NOUN
fcis-15176	33	33	problems	problem	NOUN
fcis-15176	33	34	of	of	ADP
fcis-15176	33	35	multi	multi	ADJ
fcis-15176	33	36	-	-	ADJ
fcis-15176	33	37	stage	stage	ADJ
fcis-15176	33	38	decision	decision	NOUN
fcis-15176	33	39	-	-	PUNCT
fcis-15176	33	40	making	make	VERB
fcis-15176	33	41	process[5	process[5	NOUN
fcis-15176	33	42	]	]	PUNCT
fcis-15176	33	43	,	,	PUNCT
fcis-15176	33	44	which	which	PRON
fcis-15176	33	45	is	be	AUX
fcis-15176	33	46	commonly	commonly	ADV
fcis-15176	33	47	used	use	VERB
fcis-15176	33	48	for	for	ADP
fcis-15176	33	49	solving	solve	VERB
fcis-15176	33	50	complex	complex	ADJ
fcis-15176	33	51	problems	problem	NOUN
fcis-15176	33	52	in	in	ADP
fcis-15176	33	53	mathematics	mathematic	NOUN
fcis-15176	33	54	,	,	PUNCT
fcis-15176	33	55	finance	finance	NOUN
fcis-15176	33	56	and	and	CCONJ
fcis-15176	33	57	computer	computer	NOUN
fcis-15176	33	58	science	science	NOUN
fcis-15176	33	59	,	,	PUNCT
fcis-15176	33	60	and	and	CCONJ
fcis-15176	33	61	whose	whose	DET
fcis-15176	33	62	basic	basic	ADJ
fcis-15176	33	63	idea	idea	NOUN
fcis-15176	33	64	is	be	AUX
fcis-15176	33	65	to	to	PART
fcis-15176	33	66	decompose	decompose	VERB
fcis-15176	33	67	the	the	DET
fcis-15176	33	68	problem	problem	NOUN
fcis-15176	33	69	to	to	PART
fcis-15176	33	70	be	be	AUX
fcis-15176	33	71	solved	solve	VERB
fcis-15176	33	72	into	into	ADP
fcis-15176	33	73	a	a	DET
fcis-15176	33	74	number	number	NOUN
fcis-15176	33	75	of	of	ADP
fcis-15176	33	76	simple	simple	ADJ
fcis-15176	33	77	and	and	CCONJ
fcis-15176	33	78	interconnected	interconnected	ADJ
fcis-15176	33	79	subproblems	subproblem	NOUN
fcis-15176	33	80	,	,	PUNCT
fcis-15176	33	81	solving	solve	VERB
fcis-15176	33	82	the	the	DET
fcis-15176	33	83	subproblems	subproblem	NOUN
fcis-15176	33	84	first	first	ADV
fcis-15176	33	85	,	,	PUNCT
fcis-15176	33	86	and	and	CCONJ
fcis-15176	33	87	then	then	ADV
fcis-15176	33	88	using	use	VERB
fcis-15176	33	89	the	the	DET
fcis-15176	33	90	solution	solution	NOUN
fcis-15176	33	91	of	of	ADP
fcis-15176	33	92	the	the	DET
fcis-15176	33	93	subproblems	subproblem	NOUN
fcis-15176	33	94	as	as	ADP
fcis-15176	33	95	a	a	DET
fcis-15176	33	96	the	the	DET
fcis-15176	33	97	basic	basic	ADJ
fcis-15176	33	98	idea	idea	NOUN
fcis-15176	33	99	is	be	AUX
fcis-15176	33	100	to	to	PART
fcis-15176	33	101	decompose	decompose	VERB
fcis-15176	33	102	the	the	DET
fcis-15176	33	103	problem	problem	NOUN
fcis-15176	33	104	to	to	PART
fcis-15176	33	105	be	be	AUX
fcis-15176	33	106	solved	solve	VERB
fcis-15176	33	107	into	into	ADP
fcis-15176	33	108	several	several	ADJ
fcis-15176	33	109	simple	simple	ADJ
fcis-15176	33	110	and	and	CCONJ
fcis-15176	33	111	interrelated	interrelated	ADJ
fcis-15176	33	112	sub	sub	NOUN
fcis-15176	33	113	-	-	NOUN
fcis-15176	33	114	problems	problem	NOUN
fcis-15176	33	115	,	,	PUNCT
fcis-15176	33	116	solve	solve	VERB
fcis-15176	33	117	the	the	DET
fcis-15176	33	118	sub	sub	NOUN
fcis-15176	33	119	-	-	NOUN
fcis-15176	33	120	problems	problem	NOUN
fcis-15176	33	121	first	first	ADV
fcis-15176	33	122	,	,	PUNCT
fcis-15176	33	123	and	and	CCONJ
fcis-15176	33	124	then	then	ADV
fcis-15176	33	125	use	use	VERB
fcis-15176	33	126	the	the	DET
fcis-15176	33	127	solution	solution	NOUN
fcis-15176	33	128	of	of	ADP
fcis-15176	33	129	the	the	DET
fcis-15176	33	130	sub	sub	NOUN
fcis-15176	33	131	-	-	NOUN
fcis-15176	33	132	problems	problem	NOUN
fcis-15176	33	133	as	as	ADP
fcis-15176	33	134	the	the	DET
fcis-15176	33	135	condition	condition	NOUN
fcis-15176	33	136	of	of	ADP
fcis-15176	33	137	the	the	DET
fcis-15176	33	138	upper	upper	ADJ
fcis-15176	33	139	problem	problem	NOUN
fcis-15176	33	140	until	until	SCONJ
fcis-15176	33	141	the	the	DET
fcis-15176	33	142	solution	solution	NOUN
fcis-15176	33	143	of	of	ADP
fcis-15176	33	144	the	the	DET
fcis-15176	33	145	original	original	ADJ
fcis-15176	33	146	problem	problem	NOUN
fcis-15176	33	147	is	be	AUX
fcis-15176	33	148	found	find	VERB
fcis-15176	33	149	.	.	PUNCT
fcis-15176	34	1	it	it	PRON
fcis-15176	34	2	is	be	AUX
fcis-15176	34	3	worth	worth	ADJ
fcis-15176	34	4	noting	note	VERB
fcis-15176	34	5	that	that	SCONJ
fcis-15176	34	6	the	the	DET
fcis-15176	34	7	problems	problem	NOUN
fcis-15176	34	8	solved	solve	VERB
fcis-15176	34	9	by	by	ADP
fcis-15176	34	10	dynamic	dynamic	ADJ
fcis-15176	34	11	programming	programming	NOUN
fcis-15176	34	12	are	be	AUX
fcis-15176	34	13	often	often	ADV
fcis-15176	34	14	not	not	PART
fcis-15176	34	15	independent	independent	ADJ
fcis-15176	34	16	of	of	ADP
fcis-15176	34	17	each	each	DET
fcis-15176	34	18	other	other	ADJ
fcis-15176	34	19	after	after	ADP
fcis-15176	34	20	the	the	DET
fcis-15176	34	21	decomposition	decomposition	NOUN
fcis-15176	34	22	of	of	ADP
fcis-15176	34	23	the	the	DET
fcis-15176	34	24	subproblems[6	subproblems[6	NOUN
fcis-15176	34	25	]	]	X
fcis-15176	34	26	.	.	PUNCT
fcis-15176	35	1	because	because	SCONJ
fcis-15176	35	2	the	the	DET
fcis-15176	35	3	dynamic	dynamic	ADJ
fcis-15176	35	4	programming	programming	NOUN
fcis-15176	35	5	algorithm	algorithm	NOUN
fcis-15176	35	6	for	for	ADP
fcis-15176	35	7	recurring	recur	VERB
fcis-15176	35	8	subproblems	subproblem	NOUN
fcis-15176	35	9	,	,	PUNCT
fcis-15176	35	10	only	only	ADV
fcis-15176	35	11	in	in	ADP
fcis-15176	35	12	the	the	DET
fcis-15176	35	13	first	first	ADJ
fcis-15176	35	14	encounter	encounter	NOUN
fcis-15176	35	15	to	to	PART
fcis-15176	35	16	solve	solve	VERB
fcis-15176	35	17	it	it	PRON
fcis-15176	35	18	,	,	PUNCT
fcis-15176	35	19	and	and	CCONJ
fcis-15176	35	20	the	the	DET
fcis-15176	35	21	solution	solution	NOUN
fcis-15176	35	22	will	will	AUX
fcis-15176	35	23	be	be	AUX
fcis-15176	35	24	saved	save	VERB
fcis-15176	35	25	for	for	SCONJ
fcis-15176	35	26	subsequent	subsequent	ADJ
fcis-15176	35	27	states	state	NOUN
fcis-15176	35	28	to	to	PART
fcis-15176	35	29	be	be	AUX
fcis-15176	35	30	used	use	VERB
fcis-15176	35	31	again	again	ADV
fcis-15176	35	32	[	[	X
fcis-15176	35	33	7	7	NUM
fcis-15176	35	34	]	]	PUNCT
fcis-15176	35	35	,	,	PUNCT
fcis-15176	35	36	so	so	CCONJ
fcis-15176	35	37	this	this	DET
fcis-15176	35	38	algorithm	algorithm	NOUN
fcis-15176	35	39	to	to	PART
fcis-15176	35	40	solve	solve	VERB
fcis-15176	35	41	the	the	DET
fcis-15176	35	42	problem	problem	NOUN
fcis-15176	35	43	is	be	AUX
fcis-15176	35	44	much	much	ADV
fcis-15176	35	45	less	less	ADJ
fcis-15176	35	46	time	time	NOUN
fcis-15176	35	47	-	-	PUNCT
fcis-15176	35	48	consuming	consume	VERB
fcis-15176	35	49	than	than	ADP
fcis-15176	35	50	other	other	ADJ
fcis-15176	35	51	methods	method	NOUN
fcis-15176	35	52	.	.	PUNCT
fcis-15176	36	1	the	the	DET
fcis-15176	36	2	steps	step	NOUN
fcis-15176	36	3	to	to	PART
fcis-15176	36	4	solve	solve	VERB
fcis-15176	36	5	the	the	DET
fcis-15176	36	6	problem	problem	NOUN
fcis-15176	36	7	by	by	ADP
fcis-15176	36	8	applying	apply	VERB
fcis-15176	36	9	the	the	DET
fcis-15176	36	10	dynamic	dynamic	ADJ
fcis-15176	36	11	programming	programming	NOUN
fcis-15176	36	12	algorithm	algorithm	NOUN
fcis-15176	36	13	are	be	AUX
fcis-15176	36	14	as	as	SCONJ
fcis-15176	36	15	follows	follow	VERB
fcis-15176	36	16	[	[	X
fcis-15176	36	17	8	8	NUM
fcis-15176	36	18	]	]	NUM
fcis-15176	36	19	:	:	PUNCT
fcis-15176	36	20	(	(	PUNCT
fcis-15176	36	21	1	1	X
fcis-15176	36	22	)	)	PUNCT
fcis-15176	36	23	define	define	VERB
fcis-15176	36	24	sub	sub	NOUN
fcis-15176	36	25	-	-	NOUN
fcis-15176	36	26	problem	problem	NOUN
fcis-15176	36	27	.	.	PUNCT
fcis-15176	37	1	(	(	PUNCT
fcis-15176	37	2	2	2	X
fcis-15176	37	3	)	)	PUNCT
fcis-15176	37	4	guess	guess	VERB
fcis-15176	37	5	the	the	DET
fcis-15176	37	6	partial	partial	ADJ
fcis-15176	37	7	solution	solution	NOUN
fcis-15176	37	8	.	.	PUNCT
fcis-15176	38	1	(	(	PUNCT
fcis-15176	38	2	3	3	X
fcis-15176	38	3	)	)	PUNCT
fcis-15176	38	4	develop	develop	VERB
fcis-15176	38	5	recursive	recursive	ADJ
fcis-15176	38	6	relationships	relationship	NOUN
fcis-15176	38	7	between	between	ADP
fcis-15176	38	8	sub	sub	NOUN
fcis-15176	38	9	-	-	NOUN
fcis-15176	38	10	problems	problem	NOUN
fcis-15176	38	11	.	.	PUNCT
fcis-15176	39	1	(	(	PUNCT
fcis-15176	39	2	4	4	X
fcis-15176	39	3	)	)	PUNCT
fcis-15176	39	4	solve	solve	VERB
fcis-15176	39	5	the	the	DET
fcis-15176	39	6	transfer	transfer	NOUN
fcis-15176	39	7	of	of	ADP
fcis-15176	39	8	state	state	NOUN
fcis-15176	39	9	equation	equation	NOUN
fcis-15176	39	10	since	since	SCONJ
fcis-15176	39	11	the	the	DET
fcis-15176	39	12	bottom	bottom	NOUN
fcis-15176	39	13	is	be	AUX
fcis-15176	39	14	up	up	ADV
fcis-15176	39	15	.	.	PUNCT
fcis-15176	40	1	(	(	PUNCT
fcis-15176	40	2	5	5	X
fcis-15176	40	3	)	)	PUNCT
fcis-15176	40	4	combine	combine	VERB
fcis-15176	40	5	the	the	DET
fcis-15176	40	6	solutions	solution	NOUN
fcis-15176	40	7	of	of	ADP
fcis-15176	40	8	all	all	DET
fcis-15176	40	9	sub	sub	NOUN
fcis-15176	40	10	-	-	NOUN
fcis-15176	40	11	problems	problem	NOUN
fcis-15176	40	12	to	to	PART
fcis-15176	40	13	obtain	obtain	VERB
fcis-15176	40	14	the	the	DET
fcis-15176	40	15	solution	solution	NOUN
fcis-15176	40	16	of	of	ADP
fcis-15176	40	17	the	the	DET
fcis-15176	40	18	original	original	ADJ
fcis-15176	40	19	problem	problem	NOUN
fcis-15176	40	20	.	.	PUNCT
fcis-15176	41	1	example	example	NOUN
fcis-15176	41	2	topic	topic	NOUN
fcis-15176	41	3	:	:	PUNCT
fcis-15176	41	4	miner	miner	NOUN
fcis-15176	41	5	mining	mining	NOUN
fcis-15176	41	6	problem	problem	NOUN
fcis-15176	41	7	.	.	PUNCT
fcis-15176	42	1	it	it	PRON
fcis-15176	42	2	is	be	AUX
fcis-15176	42	3	known	know	VERB
fcis-15176	42	4	that	that	SCONJ
fcis-15176	42	5	there	there	PRON
fcis-15176	42	6	are	be	VERB
fcis-15176	42	7	5	5	NUM
fcis-15176	42	8	gold	gold	NOUN
fcis-15176	42	9	mines	mine	NOUN
fcis-15176	42	10	and	and	CCONJ
fcis-15176	42	11	10	10	NUM
fcis-15176	42	12	miners	miner	NOUN
fcis-15176	42	13	,	,	PUNCT
fcis-15176	42	14	and	and	CCONJ
fcis-15176	42	15	the	the	DET
fcis-15176	42	16	corresponding	corresponding	ADJ
fcis-15176	42	17	gold	gold	ADJ
fcis-15176	42	18	reserves	reserve	NOUN
fcis-15176	42	19	of	of	ADP
fcis-15176	42	20	the	the	DET
fcis-15176	42	21	5	5	NUM
fcis-15176	42	22	mines	mine	NOUN
fcis-15176	42	23	and	and	CCONJ
fcis-15176	42	24	the	the	DET
fcis-15176	42	25	required	required	ADJ
fcis-15176	42	26	miners	miner	NOUN
fcis-15176	42	27	are	be	AUX
fcis-15176	42	28	as	as	SCONJ
fcis-15176	42	29	follows	follow	VERB
fcis-15176	42	30	:	:	PUNCT
fcis-15176	42	31	(	(	PUNCT
fcis-15176	42	32	1	1	X
fcis-15176	42	33	)	)	PUNCT
fcis-15176	42	34	400	400	NUM
fcis-15176	42	35	gold/5	gold/5	NUM
fcis-15176	42	36	people	people	NOUN
fcis-15176	42	37	(	(	PUNCT
fcis-15176	42	38	2	2	NUM
fcis-15176	42	39	)	)	PUNCT
fcis-15176	42	40	500	500	NUM
fcis-15176	42	41	gold/5	gold/5	NUM
fcis-15176	42	42	people	people	NOUN
fcis-15176	42	43	(	(	PUNCT
fcis-15176	42	44	3	3	NUM
fcis-15176	42	45	)	)	PUNCT
fcis-15176	42	46	200	200	NUM
fcis-15176	42	47	gold/3	gold/3	NUM
fcis-15176	42	48	people	people	NOUN
fcis-15176	42	49	(	(	PUNCT
fcis-15176	42	50	4	4	NUM
fcis-15176	42	51	)	)	PUNCT
fcis-15176	42	52	300	300	NUM
fcis-15176	42	53	gold/4	gold/4	NOUN
fcis-15176	42	54	people	people	NOUN
fcis-15176	42	55	(	(	PUNCT
fcis-15176	42	56	5	5	NUM
fcis-15176	42	57	)	)	PUNCT
fcis-15176	42	58	350	350	NUM
fcis-15176	42	59	gold/3	gold/3	NUM
fcis-15176	42	60	people	people	NOUN
fcis-15176	42	61	a	a	DET
fcis-15176	42	62	miner	miner	NOUN
fcis-15176	42	63	can	can	AUX
fcis-15176	42	64	only	only	ADV
fcis-15176	42	65	mine	mine	VERB
fcis-15176	42	66	one	one	NUM
fcis-15176	42	67	gold	gold	NOUN
fcis-15176	42	68	mine	mine	NOUN
fcis-15176	42	69	,	,	PUNCT
fcis-15176	42	70	not	not	PART
fcis-15176	42	71	one	one	NUM
fcis-15176	42	72	and	and	CCONJ
fcis-15176	42	73	then	then	ADV
fcis-15176	42	74	another	another	PRON
fcis-15176	42	75	,	,	PUNCT
fcis-15176	42	76	and	and	CCONJ
fcis-15176	42	77	each	each	DET
fcis-15176	42	78	mine	mine	NOUN
fcis-15176	42	79	is	be	AUX
fcis-15176	42	80	either	either	CCONJ
fcis-15176	42	81	fully	fully	ADV
fcis-15176	42	82	mined	mine	VERB
fcis-15176	42	83	or	or	CCONJ
fcis-15176	42	84	not	not	PART
fcis-15176	42	85	mined	mine	VERB
fcis-15176	42	86	in	in	ADP
fcis-15176	42	87	the	the	DET
fcis-15176	42	88	first	first	ADJ
fcis-15176	42	89	place	place	NOUN
fcis-15176	42	90	.	.	PUNCT
fcis-15176	43	1	solve	solve	NOUN
fcis-15176	43	2	:	:	PUNCT
fcis-15176	43	3	which	which	PRON
fcis-15176	43	4	gold	gold	NOUN
fcis-15176	43	5	mines	mine	NOUN
fcis-15176	43	6	should	should	AUX
fcis-15176	43	7	be	be	AUX
fcis-15176	43	8	dug	dig	VERB
fcis-15176	43	9	to	to	PART
fcis-15176	43	10	get	get	VERB
fcis-15176	43	11	as	as	ADV
fcis-15176	43	12	much	much	ADJ
fcis-15176	43	13	gold	gold	NOUN
fcis-15176	43	14	as	as	ADP
fcis-15176	43	15	possible	possible	ADJ
fcis-15176	43	16	?	?	PUNCT
fcis-15176	44	1	example	example	NOUN
fcis-15176	44	2	analysis	analysis	NOUN
fcis-15176	44	3	:	:	PUNCT
fcis-15176	44	4	(	(	PUNCT
fcis-15176	44	5	1	1	X
fcis-15176	44	6	)	)	PUNCT
fcis-15176	44	7	first	first	ADV
fcis-15176	44	8	,	,	PUNCT
fcis-15176	44	9	we	we	PRON
fcis-15176	44	10	start	start	VERB
fcis-15176	44	11	by	by	ADP
fcis-15176	44	12	assuming	assume	VERB
fcis-15176	44	13	that	that	SCONJ
fcis-15176	44	14	the	the	DET
fcis-15176	44	15	ith	ith	PROPN
fcis-15176	44	16	gold	gold	NOUN
fcis-15176	44	17	mine	mine	NOUN
fcis-15176	44	18	requires	require	VERB
fcis-15176	44	19	w[i	w[i	NOUN
fcis-15176	44	20	]	]	PUNCT
fcis-15176	44	21	people	people	NOUN
fcis-15176	44	22	,	,	PUNCT
fcis-15176	44	23	and	and	CCONJ
fcis-15176	44	24	that	that	SCONJ
fcis-15176	44	25	it	it	PRON
fcis-15176	44	26	generates	generate	VERB
fcis-15176	44	27	v[i	v[i	NOUN
fcis-15176	44	28	]	]	X
fcis-15176	44	29	.	.	PUNCT
fcis-15176	45	1	(	(	PUNCT
fcis-15176	45	2	2	2	X
fcis-15176	45	3	)	)	PUNCT
fcis-15176	45	4	we	we	PRON
fcis-15176	45	5	first	first	ADV
fcis-15176	45	6	analyze	analyze	VERB
fcis-15176	45	7	the	the	DET
fcis-15176	45	8	maximum	maximum	ADJ
fcis-15176	45	9	gain	gain	NOUN
fcis-15176	45	10	that	that	PRON
fcis-15176	45	11	can	can	AUX
fcis-15176	45	12	be	be	AUX
fcis-15176	45	13	achieved	achieve	VERB
fcis-15176	45	14	at	at	ADP
fcis-15176	45	15	the	the	DET
fcis-15176	45	16	current	current	ADJ
fcis-15176	45	17	number	number	NOUN
fcis-15176	45	18	of	of	ADP
fcis-15176	45	19	users	user	NOUN
fcis-15176	45	20	when	when	SCONJ
fcis-15176	45	21	some	some	PRON
fcis-15176	45	22	of	of	ADP
fcis-15176	45	23	the	the	DET
fcis-15176	45	24	elements	element	NOUN
fcis-15176	45	25	are	be	AUX
fcis-15176	45	26	selected	select	VERB
fcis-15176	45	27	or	or	CCONJ
fcis-15176	45	28	not	not	PART
fcis-15176	45	29	and	and	CCONJ
fcis-15176	45	30	let	let	VERB
fcis-15176	45	31	f[i][j	f[i][j	NOUN
fcis-15176	45	32	]	]	PUNCT
fcis-15176	45	33	be	be	AUX
fcis-15176	45	34	the	the	DET
fcis-15176	45	35	value	value	NOUN
fcis-15176	45	36	of	of	ADP
fcis-15176	45	37	the	the	DET
fcis-15176	45	38	maximum	maximum	ADJ
fcis-15176	45	39	gain	gain	NOUN
fcis-15176	45	40	that	that	PRON
fcis-15176	45	41	can	can	AUX
fcis-15176	45	42	be	be	AUX
fcis-15176	45	43	achieved	achieve	VERB
fcis-15176	45	44	by	by	ADP
fcis-15176	45	45	using	use	VERB
fcis-15176	45	46	no	no	DET
fcis-15176	45	47	more	more	ADJ
fcis-15176	45	48	than	than	ADP
fcis-15176	45	49	j	j	PROPN
fcis-15176	45	50	people	people	NOUN
fcis-15176	45	51	for	for	ADP
fcis-15176	45	52	the	the	DET
fcis-15176	45	53	first	first	ADJ
fcis-15176	45	54	i	i	PROPN
fcis-15176	45	55	gold	gold	NOUN
fcis-15176	45	56	mines	mine	NOUN
fcis-15176	45	57	.	.	PUNCT
fcis-15176	46	1	(	(	PUNCT
fcis-15176	46	2	3	3	X
fcis-15176	46	3	)	)	PUNCT
fcis-15176	46	4	establish	establish	VERB
fcis-15176	46	5	the	the	DET
fcis-15176	46	6	recursive	recursive	ADJ
fcis-15176	46	7	relationship	relationship	NOUN
fcis-15176	46	8	equation	equation	NOUN
fcis-15176	46	9	:	:	PUNCT
fcis-15176	47	1	f	f	PROPN
fcis-15176	48	1	i	i	PRON
fcis-15176	48	2	j	j	PROPN
fcis-15176	48	3	max	max	PROPN
fcis-15176	48	4	1	1	NUM
fcis-15176	48	5	,	,	PUNCT
fcis-15176	48	6	1	1	NUM
fcis-15176	48	7	max	max	NOUN
fcis-15176	48	8	1	1	NUM
fcis-15176	48	9	,	,	PUNCT
fcis-15176	48	10	1	1	NUM
fcis-15176	48	11	,	,	PUNCT
fcis-15176	48	12	1	1	NUM
fcis-15176	48	13	(	(	PUNCT
fcis-15176	48	14	1	1	NUM
fcis-15176	48	15	)	)	PUNCT
fcis-15176	48	16	(	(	PUNCT
fcis-15176	48	17	4	4	X
fcis-15176	48	18	)	)	PUNCT
fcis-15176	48	19	then	then	ADV
fcis-15176	48	20	iterates	iterate	VERB
fcis-15176	48	21	through	through	ADP
fcis-15176	48	22	all	all	DET
fcis-15176	48	23	the	the	DET
fcis-15176	48	24	gold	gold	NOUN
fcis-15176	48	25	mines	mine	NOUN
fcis-15176	48	26	accordingly	accordingly	ADV
fcis-15176	48	27	,	,	PUNCT
fcis-15176	48	28	and	and	CCONJ
fcis-15176	48	29	finally	finally	ADV
fcis-15176	48	30	f[5][10	f[5][10	ADV
fcis-15176	48	31	]	]	PUNCT
fcis-15176	48	32	,	,	PUNCT
fcis-15176	48	33	which	which	PRON
fcis-15176	48	34	is	be	AUX
fcis-15176	48	35	the	the	DET
fcis-15176	48	36	result	result	NOUN
fcis-15176	48	37	needed	need	VERB
fcis-15176	48	38	for	for	ADP
fcis-15176	48	39	this	this	DET
fcis-15176	48	40	question	question	NOUN
fcis-15176	48	41	algorithmic	algorithmic	ADJ
fcis-15176	48	42	analysis	analysis	NOUN
fcis-15176	48	43	:	:	PUNCT
fcis-15176	48	44	(	(	PUNCT
fcis-15176	48	45	5	5	NUM
fcis-15176	48	46	)	)	PUNCT
fcis-15176	48	47	time	time	NOUN
fcis-15176	48	48	complexity	complexity	NOUN
fcis-15176	48	49	analysis	analysis	NOUN
fcis-15176	48	50	of	of	ADP
fcis-15176	48	51	the	the	DET
fcis-15176	48	52	algorithm	algorithm	NOUN
fcis-15176	48	53	,	,	PUNCT
fcis-15176	48	54	let	let	VERB
fcis-15176	48	55	the	the	DET
fcis-15176	48	56	number	number	NOUN
fcis-15176	48	57	of	of	ADP
fcis-15176	48	58	miners	miner	NOUN
fcis-15176	48	59	be	be	VERB
fcis-15176	48	60	m	m	PRON
fcis-15176	48	61	and	and	CCONJ
fcis-15176	48	62	the	the	DET
fcis-15176	48	63	number	number	NOUN
fcis-15176	48	64	of	of	ADP
fcis-15176	48	65	mines	mine	NOUN
fcis-15176	48	66	be	be	VERB
fcis-15176	48	67	n	n	NUM
fcis-15176	48	68	,	,	PUNCT
fcis-15176	48	69	then	then	ADV
fcis-15176	48	70	the	the	DET
fcis-15176	48	71	time	time	NOUN
fcis-15176	48	72	complexity	complexity	NOUN
fcis-15176	48	73	of	of	ADP
fcis-15176	48	74	the	the	DET
fcis-15176	48	75	current	current	ADJ
fcis-15176	48	76	algorithm	algorithm	NOUN
fcis-15176	48	77	is	be	AUX
fcis-15176	48	78	o(n*m	o(n*m	NOUN
fcis-15176	48	79	)	)	PUNCT
fcis-15176	48	80	the	the	DET
fcis-15176	48	81	program	program	NOUN
fcis-15176	48	82	and	and	CCONJ
fcis-15176	48	83	running	running	NOUN
fcis-15176	48	84	results	result	NOUN
fcis-15176	48	85	are	be	AUX
fcis-15176	48	86	shown	show	VERB
fcis-15176	48	87	in	in	ADP
fcis-15176	48	88	figure	figure	NOUN
fcis-15176	48	89	3	3	NUM
fcis-15176	48	90	:	:	PUNCT
fcis-15176	48	91	figure	figure	NOUN
fcis-15176	48	92	3	3	NUM
fcis-15176	48	93	.	.	NOUN
fcis-15176	48	94	problem	problem	NOUN
fcis-15176	48	95	of	of	ADP
fcis-15176	48	96	miners	miner	NOUN
fcis-15176	48	97	digging	dig	VERB
fcis-15176	48	98	considerations	consideration	NOUN
fcis-15176	48	99	for	for	ADP
fcis-15176	48	100	using	use	VERB
fcis-15176	48	101	dynamic	dynamic	ADJ
fcis-15176	48	102	programming	programming	NOUN
fcis-15176	48	103	algorithms	algorithm	NOUN
fcis-15176	48	104	:	:	PUNCT
fcis-15176	48	105	(	(	PUNCT
fcis-15176	48	106	1	1	X
fcis-15176	48	107	)	)	PUNCT
fcis-15176	48	108	definition	definition	NOUN
fcis-15176	48	109	analyzes	analyze	VERB
fcis-15176	48	110	whether	whether	SCONJ
fcis-15176	48	111	the	the	DET
fcis-15176	48	112	problem	problem	NOUN
fcis-15176	48	113	has	have	VERB
fcis-15176	48	114	the	the	DET
fcis-15176	48	115	properties	property	NOUN
fcis-15176	48	116	of	of	ADP
fcis-15176	48	117	optimal	optimal	ADJ
fcis-15176	48	118	substructure	substructure	NOUN
fcis-15176	48	119	and	and	CCONJ
fcis-15176	48	120	overlapping	overlap	VERB
fcis-15176	48	121	subproblems	subproblem	NOUN
fcis-15176	48	122	[	[	X
fcis-15176	48	123	9	9	NUM
fcis-15176	48	124	]	]	PUNCT
fcis-15176	48	125	and	and	CCONJ
fcis-15176	48	126	can	can	AUX
fcis-15176	48	127	only	only	ADV
fcis-15176	48	128	be	be	AUX
fcis-15176	48	129	solved	solve	VERB
fcis-15176	48	130	using	use	VERB
fcis-15176	48	131	dynamic	dynamic	ADJ
fcis-15176	48	132	programming	programming	NOUN
fcis-15176	48	133	algorithms	algorithm	NOUN
fcis-15176	48	134	when	when	SCONJ
fcis-15176	48	135	the	the	DET
fcis-15176	48	136	problem	problem	NOUN
fcis-15176	48	137	satisfies	satisfy	VERB
fcis-15176	48	138	these	these	DET
fcis-15176	48	139	two	two	NUM
fcis-15176	48	140	properties	property	NOUN
fcis-15176	48	141	.	.	PUNCT
fcis-15176	49	1	(	(	PUNCT
fcis-15176	49	2	2	2	X
fcis-15176	49	3	)	)	PUNCT
fcis-15176	49	4	the	the	DET
fcis-15176	49	5	results	result	NOUN
fcis-15176	49	6	of	of	ADP
fcis-15176	49	7	each	each	DET
fcis-15176	49	8	operation	operation	NOUN
fcis-15176	49	9	need	need	VERB
fcis-15176	49	10	to	to	PART
fcis-15176	49	11	be	be	AUX
fcis-15176	49	12	saved	save	VERB
fcis-15176	49	13	so	so	SCONJ
fcis-15176	49	14	that	that	SCONJ
fcis-15176	49	15	resources	resource	NOUN
fcis-15176	49	16	are	be	AUX
fcis-15176	49	17	not	not	PART
fcis-15176	49	18	wasted	waste	VERB
fcis-15176	49	19	on	on	ADP
fcis-15176	49	20	calculating	calculate	VERB
fcis-15176	49	21	the	the	DET
fcis-15176	49	22	same	same	ADJ
fcis-15176	49	23	thing	thing	NOUN
fcis-15176	49	24	later	later	ADV
fcis-15176	49	25	.	.	PUNCT
fcis-15176	50	1	(	(	PUNCT
fcis-15176	50	2	3	3	X
fcis-15176	50	3	)	)	PUNCT
fcis-15176	50	4	for	for	ADP
fcis-15176	50	5	the	the	DET
fcis-15176	50	6	current	current	ADJ
fcis-15176	50	7	problem	problem	NOUN
fcis-15176	50	8	if	if	SCONJ
fcis-15176	50	9	you	you	PRON
fcis-15176	50	10	ca	can	AUX
fcis-15176	50	11	n't	not	PART
fcis-15176	50	12	represent	represent	VERB
fcis-15176	50	13	its	its	PRON
fcis-15176	50	14	state	state	NOUN
fcis-15176	50	15	using	use	VERB
fcis-15176	50	16	a	a	DET
fcis-15176	50	17	low	low	ADJ
fcis-15176	50	18	-	-	PUNCT
fcis-15176	50	19	dimensional	dimensional	ADJ
fcis-15176	50	20	array	array	NOUN
fcis-15176	50	21	,	,	PUNCT
fcis-15176	50	22	you	you	PRON
fcis-15176	50	23	need	need	VERB
fcis-15176	50	24	to	to	PART
fcis-15176	50	25	open	open	VERB
fcis-15176	50	26	a	a	DET
fcis-15176	50	27	highdimensional	highdimensional	ADJ
fcis-15176	50	28	array	array	NOUN
fcis-15176	50	29	to	to	PART
fcis-15176	50	30	represent	represent	VERB
fcis-15176	50	31	its	its	PRON
fcis-15176	50	32	state	state	NOUN
fcis-15176	50	33	.	.	PUNCT
fcis-15176	51	1	4	4	X
fcis-15176	51	2	.	.	X
fcis-15176	51	3	conclusion	conclusion	NOUN
fcis-15176	51	4	through	through	ADP
fcis-15176	51	5	this	this	DET
fcis-15176	51	6	article	article	NOUN
fcis-15176	51	7	on	on	ADP
fcis-15176	51	8	the	the	DET
fcis-15176	51	9	greedy	greedy	ADJ
fcis-15176	51	10	algorithm	algorithm	NOUN
fcis-15176	51	11	and	and	CCONJ
fcis-15176	51	12	the	the	DET
fcis-15176	51	13	dynamic	dynamic	ADJ
fcis-15176	51	14	programming	programming	NOUN
fcis-15176	51	15	algorithm	algorithm	NOUN
fcis-15176	51	16	,	,	PUNCT
fcis-15176	51	17	we	we	PRON
fcis-15176	51	18	can	can	AUX
fcis-15176	51	19	see	see	VERB
fcis-15176	51	20	the	the	DET
fcis-15176	51	21	differences	difference	NOUN
fcis-15176	51	22	and	and	CCONJ
fcis-15176	51	23	applications	application	NOUN
fcis-15176	51	24	between	between	ADP
fcis-15176	51	25	the	the	DET
fcis-15176	51	26	two	two	NUM
fcis-15176	51	27	algorithms	algorithm	NOUN
fcis-15176	51	28	,	,	PUNCT
fcis-15176	51	29	with	with	ADP
fcis-15176	51	30	the	the	DET
fcis-15176	51	31	greedy	greedy	ADJ
fcis-15176	51	32	method	method	NOUN
fcis-15176	51	33	being	be	AUX
fcis-15176	51	34	a	a	DET
fcis-15176	51	35	special	special	ADJ
fcis-15176	51	36	case	case	NOUN
fcis-15176	51	37	of	of	ADP
fcis-15176	51	38	dynamic	dynamic	ADJ
fcis-15176	51	39	programming	programming	NOUN
fcis-15176	51	40	.	.	PUNCT
fcis-15176	52	1	in	in	ADP
fcis-15176	52	2	54	54	NUM
fcis-15176	52	3	python	python	NOUN
fcis-15176	52	4	,	,	PUNCT
fcis-15176	52	5	the	the	DET
fcis-15176	52	6	implementation	implementation	NOUN
fcis-15176	52	7	of	of	ADP
fcis-15176	52	8	the	the	DET
fcis-15176	52	9	two	two	NUM
fcis-15176	52	10	algorithms	algorithm	NOUN
fcis-15176	52	11	is	be	AUX
fcis-15176	52	12	very	very	ADV
fcis-15176	52	13	similar	similar	ADJ
fcis-15176	52	14	,	,	PUNCT
fcis-15176	52	15	both	both	PRON
fcis-15176	52	16	need	need	VERB
fcis-15176	52	17	to	to	PART
fcis-15176	52	18	explicitly	explicitly	ADV
fcis-15176	52	19	perform	perform	VERB
fcis-15176	52	20	state	state	NOUN
fcis-15176	52	21	transfer	transfer	NOUN
fcis-15176	52	22	and	and	CCONJ
fcis-15176	52	23	optimization	optimization	NOUN
fcis-15176	52	24	solution	solution	NOUN
fcis-15176	52	25	.	.	PUNCT
fcis-15176	53	1	in	in	ADP
fcis-15176	53	2	practice	practice	NOUN
fcis-15176	53	3	,	,	PUNCT
fcis-15176	53	4	we	we	PRON
fcis-15176	53	5	need	need	VERB
fcis-15176	53	6	to	to	PART
fcis-15176	53	7	choose	choose	VERB
fcis-15176	53	8	the	the	DET
fcis-15176	53	9	suitable	suitable	ADJ
fcis-15176	53	10	algorithm	algorithm	NOUN
fcis-15176	53	11	to	to	PART
fcis-15176	53	12	solve	solve	VERB
fcis-15176	53	13	the	the	DET
fcis-15176	53	14	problem	problem	NOUN
fcis-15176	53	15	according	accord	VERB
fcis-15176	53	16	to	to	ADP
fcis-15176	53	17	the	the	DET
fcis-15176	53	18	characteristics	characteristic	NOUN
fcis-15176	53	19	and	and	CCONJ
fcis-15176	53	20	requirements	requirement	NOUN
fcis-15176	53	21	of	of	ADP
fcis-15176	53	22	the	the	DET
fcis-15176	53	23	problem	problem	NOUN
fcis-15176	53	24	.	.	PUNCT
fcis-15176	54	1	python	python	PROPN
fcis-15176	54	2	,	,	PUNCT
fcis-15176	54	3	as	as	ADP
fcis-15176	54	4	a	a	DET
fcis-15176	54	5	programming	programming	NOUN
fcis-15176	54	6	language	language	NOUN
fcis-15176	54	7	with	with	ADP
fcis-15176	54	8	very	very	ADV
fcis-15176	54	9	high	high	ADJ
fcis-15176	54	10	language	language	NOUN
fcis-15176	54	11	readability	readability	NOUN
fcis-15176	54	12	and	and	CCONJ
fcis-15176	54	13	ease	ease	NOUN
fcis-15176	54	14	of	of	ADP
fcis-15176	54	15	learning	learning	NOUN
fcis-15176	54	16	,	,	PUNCT
fcis-15176	54	17	provides	provide	VERB
fcis-15176	54	18	us	we	PRON
fcis-15176	54	19	with	with	ADP
fcis-15176	54	20	a	a	DET
fcis-15176	54	21	good	good	ADJ
fcis-15176	54	22	convenience	convenience	NOUN
fcis-15176	54	23	for	for	ADP
fcis-15176	54	24	optimization	optimization	NOUN
fcis-15176	54	25	algorithm	algorithm	NOUN
fcis-15176	54	26	design	design	NOUN
fcis-15176	54	27	.	.	PUNCT
fcis-15176	55	1	we	we	PRON
fcis-15176	55	2	believe	believe	VERB
fcis-15176	55	3	that	that	SCONJ
fcis-15176	55	4	python	python	PROPN
fcis-15176	55	5	and	and	CCONJ
fcis-15176	55	6	these	these	DET
fcis-15176	55	7	two	two	NUM
fcis-15176	55	8	algorithms	algorithm	NOUN
fcis-15176	55	9	will	will	AUX
fcis-15176	55	10	play	play	VERB
fcis-15176	55	11	a	a	DET
fcis-15176	55	12	more	more	ADV
fcis-15176	55	13	important	important	ADJ
fcis-15176	55	14	role	role	NOUN
fcis-15176	55	15	in	in	ADP
fcis-15176	55	16	the	the	DET
fcis-15176	55	17	future	future	ADJ
fcis-15176	55	18	learning	learning	NOUN
fcis-15176	55	19	and	and	CCONJ
fcis-15176	55	20	application	application	NOUN
fcis-15176	55	21	.	.	PUNCT
fcis-15176	56	1	acknowledgments	acknowledgment	NOUN
fcis-15176	56	2	this	this	DET
fcis-15176	56	3	work	work	NOUN
fcis-15176	56	4	was	be	AUX
fcis-15176	56	5	supported	support	VERB
fcis-15176	56	6	by	by	ADP
fcis-15176	56	7	postgraduate	postgraduate	NOUN
fcis-15176	56	8	education	education	NOUN
fcis-15176	56	9	innovation	innovation	NOUN
fcis-15176	56	10	project	project	NOUN
fcis-15176	56	11	of	of	ADP
fcis-15176	56	12	guangdong	guangdong	PROPN
fcis-15176	56	13	ocean	ocean	PROPN
fcis-15176	56	14	university	university	PROPN
fcis-15176	56	15	(	(	PUNCT
fcis-15176	56	16	202303	202303	NUM
fcis-15176	56	17	)	)	PUNCT
fcis-15176	56	18	and	and	CCONJ
fcis-15176	56	19	guangdong	guangdong	PROPN
fcis-15176	56	20	ocean	ocean	PROPN
fcis-15176	56	21	university	university	PROPN
fcis-15176	56	22	innovation	innovation	NOUN
fcis-15176	56	23	and	and	CCONJ
fcis-15176	56	24	entrepreneurship	entrepreneurship	NOUN
fcis-15176	56	25	training	training	NOUN
fcis-15176	56	26	program	program	NOUN
fcis-15176	56	27	project	project	NOUN
fcis-15176	56	28	grant	grant	NOUN
fcis-15176	56	29	(	(	PUNCT
fcis-15176	56	30	cyxl2023005	cyxl2023005	PROPN
fcis-15176	56	31	)	)	PUNCT
fcis-15176	56	32	(	(	PUNCT
fcis-15176	56	33	cxxl2023124	cxxl2023124	PROPN
fcis-15176	56	34	)	)	PUNCT
fcis-15176	56	35	(	(	PUNCT
fcis-15176	56	36	cxxl2023134	cxxl2023134	PROPN
fcis-15176	56	37	)	)	PUNCT
fcis-15176	56	38	.	.	PUNCT
fcis-15176	57	1	references	reference	NOUN
fcis-15176	57	2	[	[	X
fcis-15176	57	3	1	1	X
fcis-15176	57	4	]	]	X
fcis-15176	57	5	liu	liu	PROPN
fcis-15176	57	6	dan	dan	PROPN
fcis-15176	57	7	.	.	PROPN
fcis-15176	57	8	research	research	PROPN
fcis-15176	57	9	on	on	ADP
fcis-15176	57	10	automatic	automatic	ADJ
fcis-15176	57	11	class	class	NOUN
fcis-15176	57	12	scheduling	scheduling	NOUN
fcis-15176	57	13	method	method	NOUN
fcis-15176	57	14	based	base	VERB
fcis-15176	57	15	on	on	ADP
fcis-15176	57	16	greedy	greedy	ADJ
fcis-15176	57	17	algorithm	algorithm	NOUN
fcis-15176	58	1	[	[	X
fcis-15176	58	2	j	j	X
fcis-15176	58	3	]	]	X
fcis-15176	58	4	.	.	PUNCT
fcis-15176	59	1	information	information	NOUN
fcis-15176	59	2	and	and	CCONJ
fcis-15176	59	3	computer	computer	NOUN
fcis-15176	59	4	(	(	PUNCT
fcis-15176	59	5	theoretical	theoretical	ADJ
fcis-15176	59	6	edition),2020,32(04):36	edition),2020,32(04):36	NOUN
fcis-15176	59	7	-	-	PUNCT
fcis-15176	59	8	38	38	NUM
fcis-15176	59	9	.	.	PUNCT
fcis-15176	60	1	[	[	X
fcis-15176	60	2	2	2	X
fcis-15176	60	3	]	]	X
fcis-15176	60	4	chang	chang	PROPN
fcis-15176	60	5	youqu	youqu	PROPN
fcis-15176	60	6	,	,	PUNCT
fcis-15176	60	7	xiao	xiao	PROPN
fcis-15176	60	8	guiyuan	guiyuan	PROPN
fcis-15176	60	9	,	,	PUNCT
fcis-15176	60	10	zeng	zeng	PROPN
fcis-15176	60	11	min	min	PROPN
fcis-15176	60	12	.	.	PROPN
fcis-15176	60	13	exploration	exploration	NOUN
fcis-15176	60	14	and	and	CCONJ
fcis-15176	60	15	research	research	NOUN
fcis-15176	60	16	on	on	ADP
fcis-15176	60	17	greedy	greedy	ADJ
fcis-15176	60	18	algorithm[j	algorithm[j	PROPN
fcis-15176	60	19	]	]	PUNCT
fcis-15176	60	20	.	.	PUNCT
fcis-15176	61	1	journal	journal	PROPN
fcis-15176	61	2	of	of	ADP
fcis-15176	61	3	chongqing	chongqing	PROPN
fcis-15176	61	4	electric	electric	PROPN
fcis-15176	61	5	power	power	PROPN
fcis-15176	61	6	college	college	PROPN
fcis-15176	61	7	,	,	PUNCT
fcis-15176	61	8	2008	2008	NUM
fcis-15176	61	9	,	,	PUNCT
fcis-15176	61	10	13(3):40	13(3):40	PROPN
fcis-15176	61	11	-	-	SYM
fcis-15176	61	12	42	42	NUM
fcis-15176	61	13	.	.	PUNCT
fcis-15176	62	1	[	[	X
fcis-15176	62	2	3	3	X
fcis-15176	62	3	]	]	PUNCT
fcis-15176	62	4	bi	bi	PROPN
fcis-15176	62	5	longge	longge	PROPN
fcis-15176	62	6	.	.	PUNCT
fcis-15176	63	1	greedy	greedy	ADJ
fcis-15176	63	2	algorithm	algorithm	NOUN
fcis-15176	63	3	and	and	CCONJ
fcis-15176	63	4	linear	linear	PROPN
fcis-15176	63	5	programming[j	programming[j	NOUN
fcis-15176	63	6	]	]	PUNCT
fcis-15176	63	7	.	.	PUNCT
fcis-15176	64	1	computer	computer	NOUN
fcis-15176	64	2	products	product	NOUN
fcis-15176	64	3	and	and	CCONJ
fcis-15176	64	4	distribution,2017	distribution,2017	NOUN
fcis-15176	64	5	,	,	PUNCT
fcis-15176	64	6	(	(	PUNCT
fcis-15176	64	7	11):239	11):239	NUM
fcis-15176	64	8	+	+	NOUN
fcis-15176	64	9	251	251	NUM
fcis-15176	64	10	.	.	PUNCT
fcis-15176	65	1	[	[	X
fcis-15176	65	2	4	4	X
fcis-15176	65	3	]	]	X
fcis-15176	65	4	wang	wang	PROPN
fcis-15176	65	5	ying	ying	PROPN
fcis-15176	65	6	.	.	PUNCT
fcis-15176	66	1	on	on	ADP
fcis-15176	66	2	the	the	DET
fcis-15176	66	3	application	application	NOUN
fcis-15176	66	4	of	of	ADP
fcis-15176	66	5	greedy	greedy	ADJ
fcis-15176	66	6	algorithm	algorithm	NOUN
fcis-15176	66	7	in	in	ADP
fcis-15176	66	8	graph	graph	NOUN
fcis-15176	66	9	theory	theory	NOUN
fcis-15176	66	10	[	[	X
fcis-15176	66	11	j	j	X
fcis-15176	66	12	]	]	X
fcis-15176	66	13	.	.	PUNCT
fcis-15176	67	1	computer	computer	PROPN
fcis-15176	67	2	cd	cd	PROPN
fcis-15176	67	3	-	-	PUNCT
fcis-15176	67	4	rom	rom	NOUN
fcis-15176	67	5	software	software	NOUN
fcis-15176	67	6	and	and	CCONJ
fcis-15176	67	7	applications	application	NOUN
fcis-15176	67	8	,	,	PUNCT
fcis-15176	67	9	2013	2013	NUM
fcis-15176	67	10	,	,	PUNCT
fcis-15176	67	11	16(16):309	16(16):309	NUM
fcis-15176	67	12	+	+	NOUN
fcis-15176	67	13	311	311	NUM
fcis-15176	67	14	.	.	PUNCT
fcis-15176	68	1	[	[	X
fcis-15176	68	2	5	5	NUM
fcis-15176	68	3	]	]	X
fcis-15176	68	4	cheng	cheng	PROPN
fcis-15176	68	5	zhenbo	zhenbo	PROPN
fcis-15176	68	6	,	,	PUNCT
fcis-15176	68	7	li	li	PROPN
fcis-15176	68	8	qu	qu	PROPN
fcis-15176	68	9	,	,	PUNCT
fcis-15176	68	10	wang	wang	PROPN
fcis-15176	68	11	chunping	chunping	PROPN
fcis-15176	68	12	.	.	PUNCT
fcis-15176	68	13	algorithm	algorithm	PROPN
fcis-15176	68	14	design	design	NOUN
fcis-15176	68	15	and	and	CCONJ
fcis-15176	68	16	analysis[m	analysis[m	ADJ
fcis-15176	68	17	]	]	PUNCT
fcis-15176	68	18	.	.	PUNCT
fcis-15176	69	1	tsinghua	tsinghua	PROPN
fcis-15176	69	2	university	university	PROPN
fcis-15176	69	3	press	press	NOUN
fcis-15176	69	4	:	:	PUNCT
fcis-15176	69	5	tsinghua	tsinghua	PROPN
fcis-15176	69	6	university	university	PROPN
fcis-15176	69	7	academic	academic	ADJ
fcis-15176	69	8	research	research	NOUN
fcis-15176	69	9	building	building	NOUN
fcis-15176	69	10	,	,	PUNCT
fcis-15176	69	11	beijing,2018	beijing,2018	NOUN
fcis-15176	69	12	.	.	PUNCT
fcis-15176	70	1	[	[	X
fcis-15176	70	2	6	6	NUM
fcis-15176	70	3	]	]	X
fcis-15176	70	4	dong	dong	PROPN
fcis-15176	70	5	junjun	junjun	PROPN
fcis-15176	70	6	.	.	PUNCT
fcis-15176	71	1	comparison	comparison	NOUN
fcis-15176	71	2	and	and	CCONJ
fcis-15176	71	3	analysis	analysis	NOUN
fcis-15176	71	4	of	of	ADP
fcis-15176	71	5	dynamic	dynamic	ADJ
fcis-15176	71	6	programming	programming	NOUN
fcis-15176	71	7	algorithm	algorithm	NOUN
fcis-15176	71	8	and	and	CCONJ
fcis-15176	71	9	greedy	greedy	ADJ
fcis-15176	71	10	algorithm[j	algorithm[j	PROPN
fcis-15176	71	11	]	]	PUNCT
fcis-15176	71	12	.	.	PUNCT
fcis-15176	72	1	software	software	PROPN
fcis-15176	72	2	journal	journal	PROPN
fcis-15176	72	3	,	,	PUNCT
fcis-15176	72	4	2008	2008	NUM
fcis-15176	72	5	,	,	PUNCT
fcis-15176	72	6	(	(	PUNCT
fcis-15176	72	7	02):129	02):129	NOUN
fcis-15176	72	8	-	-	PUNCT
fcis-15176	72	9	130	130	NUM
fcis-15176	72	10	.	.	PUNCT
fcis-15176	73	1	[	[	X
fcis-15176	73	2	7	7	X
fcis-15176	73	3	]	]	X
fcis-15176	73	4	zhang	zhang	PROPN
fcis-15176	73	5	aihua	aihua	PROPN
fcis-15176	73	6	,	,	PUNCT
fcis-15176	73	7	guo	guo	PROPN
fcis-15176	73	8	xiyue	xiyue	PROPN
fcis-15176	73	9	,	,	PUNCT
fcis-15176	73	10	chen	chen	PROPN
fcis-15176	73	11	qianjun	qianjun	PROPN
fcis-15176	73	12	.	.	PUNCT
fcis-15176	73	13	analysis	analysis	NOUN
fcis-15176	73	14	and	and	CCONJ
fcis-15176	73	15	research	research	NOUN
fcis-15176	73	16	on	on	ADP
fcis-15176	73	17	dynamic	dynamic	ADJ
fcis-15176	73	18	programming	programming	NOUN
fcis-15176	73	19	algorithms[j	algorithms[j	PROPN
fcis-15176	73	20	]	]	X
fcis-15176	73	21	.	.	PUNCT
fcis-15176	74	1	software	software	PROPN
fcis-15176	74	2	guide,2014,13(12):68	guide,2014,13(12):68	PROPN
fcis-15176	74	3	-	-	PUNCT
fcis-15176	74	4	69	69	NUM
fcis-15176	74	5	.	.	PUNCT
fcis-15176	75	1	[	[	X
fcis-15176	75	2	8	8	X
fcis-15176	75	3	]	]	X
fcis-15176	75	4	shi	shi	PROPN
fcis-15176	75	5	shaojian	shaojian	PROPN
fcis-15176	75	6	,	,	PUNCT
fcis-15176	75	7	zhang	zhang	PROPN
fcis-15176	75	8	hong	hong	PROPN
fcis-15176	75	9	,	,	PUNCT
fcis-15176	75	10	shi	shi	PROPN
fcis-15176	75	11	zheng	zheng	PROPN
fcis-15176	75	12	.	.	PUNCT
fcis-15176	76	1	research	research	NOUN
fcis-15176	76	2	on	on	ADP
fcis-15176	76	3	dynamic	dynamic	ADJ
fcis-15176	76	4	programming	programming	NOUN
fcis-15176	76	5	algorithms[j	algorithms[j	PROPN
fcis-15176	76	6	]	]	X
fcis-15176	76	7	.	.	PUNCT
fcis-15176	77	1	computer	computer	NOUN
fcis-15176	77	2	knowledge	knowledge	NOUN
fcis-15176	77	3	and	and	CCONJ
fcis-15176	77	4	technology,2020,16(18):48	technology,2020,16(18):48	NOUN
fcis-15176	77	5	-	-	PUNCT
fcis-15176	77	6	49	49	NUM
fcis-15176	77	7	.	.	PUNCT
fcis-15176	78	1	[	[	X
fcis-15176	78	2	9	9	NUM
fcis-15176	78	3	]	]	X
fcis-15176	78	4	wang	wang	PROPN
fcis-15176	78	5	junxiang	junxiang	PROPN
fcis-15176	78	6	.	.	PUNCT
fcis-15176	79	1	research	research	NOUN
fcis-15176	79	2	on	on	ADP
fcis-15176	79	3	the	the	DET
fcis-15176	79	4	principle	principle	NOUN
fcis-15176	79	5	and	and	CCONJ
fcis-15176	79	6	application	application	NOUN
fcis-15176	79	7	of	of	ADP
fcis-15176	79	8	dynamic	dynamic	ADJ
fcis-15176	79	9	programming	programming	NOUN
fcis-15176	79	10	algorithm[j	algorithm[j	PROPN
fcis-15176	79	11	]	]	PUNCT
fcis-15176	79	12	.	.	PUNCT
fcis-15176	80	1	computer	computer	NOUN
fcis-15176	80	2	knowledge	knowledge	NOUN
fcis-15176	80	3	and	and	CCONJ
fcis-15176	80	4	technology	technology	NOUN
fcis-15176	80	5	:	:	PUNCT
fcis-15176	80	6	academic	academic	ADJ
fcis-15176	80	7	exchange	exchange	NOUN
fcis-15176	80	8	,	,	PUNCT
fcis-15176	80	9	2006	2006	NUM
fcis-15176	80	10	.	.	PUNCT
fcis-15176	81	1	[	[	X
fcis-15176	81	2	10	10	NUM
fcis-15176	81	3	]	]	X
fcis-15176	81	4	zhang	zhang	PROPN
fcis-15176	81	5	m	m	PROPN
fcis-15176	81	6	,	,	PUNCT
fcis-15176	81	7	zhao	zhao	PROPN
fcis-15176	81	8	h	h	PROPN
fcis-15176	81	9	,	,	PUNCT
fcis-15176	81	10	et	et	PROPN
fcis-15176	81	11	al	al	PROPN
fcis-15176	81	12	.	.	PUNCT
fcis-15176	81	13	experimental	experimental	ADJ
fcis-15176	81	14	tutorial	tutorial	NOUN
fcis-15176	81	15	on	on	ADP
fcis-15176	81	16	data	datum	NOUN
fcis-15176	81	17	structures	structure	NOUN
fcis-15176	81	18	and	and	CCONJ
fcis-15176	81	19	algorithms	algorithm	NOUN
fcis-15176	81	20	[	[	X
fcis-15176	81	21	m	m	X
fcis-15176	81	22	]	]	X
fcis-15176	81	23	.	.	PUNCT
fcis-15176	82	1	beijing	beijing	PROPN
fcis-15176	82	2	.	.	PUNCT
fcis-15176	83	1	higher	high	ADJ
fcis-15176	83	2	education	education	NOUN
fcis-15176	83	3	press.2011	press.2011	PROPN
fcis-15176	83	4	.	.	PUNCT