id	sid	tid	token	lemma	pos
ajst-30556	1	1	academic	academic	ADJ
ajst-30556	1	2	journal	journal	NOUN
ajst-30556	1	3	of	of	ADP
ajst-30556	1	4	science	science	NOUN
ajst-30556	1	5	and	and	CCONJ
ajst-30556	1	6	technology	technology	NOUN
ajst-30556	1	7	issn	issn	NOUN
ajst-30556	1	8	:	:	PUNCT
ajst-30556	1	9	2771	2771	NUM
ajst-30556	1	10	-	-	SYM
ajst-30556	1	11	3032	3032	NUM
ajst-30556	1	12	|	|	NOUN
ajst-30556	1	13	vol	vol	NOUN
ajst-30556	1	14	.	.	PROPN
ajst-30556	1	15	15	15	NUM
ajst-30556	1	16	,	,	PUNCT
ajst-30556	1	17	no	no	INTJ
ajst-30556	1	18	.	.	NOUN
ajst-30556	1	19	1	1	NUM
ajst-30556	1	20	,	,	PUNCT
ajst-30556	1	21	2025	2025	NUM
ajst-30556	1	22	243	243	NUM
ajst-30556	1	23	an	an	DET
ajst-30556	1	24	escape	escape	NOUN
ajst-30556	1	25	from	from	ADP
ajst-30556	1	26	local	local	ADJ
ajst-30556	1	27	optima	optima	PROPN
ajst-30556	1	28	algorithm	algorithm	NOUN
ajst-30556	1	29	based	base	VERB
ajst-30556	1	30	on	on	ADP
ajst-30556	1	31	historical	historical	ADJ
ajst-30556	1	32	feature	feature	NOUN
ajst-30556	1	33	distribution	distribution	NOUN
ajst-30556	1	34	for	for	ADP
ajst-30556	1	35	solving	solve	VERB
ajst-30556	1	36	continuous	continuous	ADJ
ajst-30556	1	37	distributed	distribute	VERB
ajst-30556	1	38	constraint	constraint	NOUN
ajst-30556	1	39	optimization	optimization	NOUN
ajst-30556	1	40	problems	problem	NOUN
ajst-30556	1	41	meifeng	meifeng	PROPN
ajst-30556	1	42	shi1	shi1	PROPN
ajst-30556	1	43	,	,	PUNCT
ajst-30556	1	44	junnan	junnan	NOUN
ajst-30556	1	45	she2	she2	NOUN
ajst-30556	1	46	and	and	CCONJ
ajst-30556	1	47	tao	tao	PROPN
ajst-30556	1	48	lo3	lo3	PROPN
ajst-30556	1	49	1department	1department	NUM
ajst-30556	1	50	of	of	ADP
ajst-30556	1	51	computer	computer	NOUN
ajst-30556	1	52	science	science	NOUN
ajst-30556	1	53	and	and	CCONJ
ajst-30556	1	54	engineering	engineering	NOUN
ajst-30556	1	55	,	,	PUNCT
ajst-30556	1	56	chongqing	chongqing	PROPN
ajst-30556	1	57	university	university	PROPN
ajst-30556	1	58	of	of	ADP
ajst-30556	1	59	technology	technology	NOUN
ajst-30556	1	60	,	,	PUNCT
ajst-30556	1	61	chongqing	chongqe	VERB
ajst-30556	1	62	400054	400054	NUM
ajst-30556	1	63	,	,	PUNCT
ajst-30556	1	64	china	china	PROPN
ajst-30556	1	65	2department	2department	NUM
ajst-30556	1	66	of	of	ADP
ajst-30556	1	67	computer	computer	NOUN
ajst-30556	1	68	science	science	NOUN
ajst-30556	1	69	and	and	CCONJ
ajst-30556	1	70	engineering	engineering	NOUN
ajst-30556	1	71	,	,	PUNCT
ajst-30556	1	72	chongqing	chongqing	PROPN
ajst-30556	1	73	university	university	PROPN
ajst-30556	1	74	of	of	ADP
ajst-30556	1	75	technology	technology	NOUN
ajst-30556	1	76	,	,	PUNCT
ajst-30556	1	77	chongqing	chongqe	VERB
ajst-30556	1	78	400054	400054	NUM
ajst-30556	1	79	,	,	PUNCT
ajst-30556	1	80	china	china	PROPN
ajst-30556	1	81	3school	3school	NUM
ajst-30556	1	82	of	of	ADP
ajst-30556	1	83	computing	computing	NOUN
ajst-30556	1	84	and	and	CCONJ
ajst-30556	1	85	artificial	artificial	ADJ
ajst-30556	1	86	intelligence	intelligence	NOUN
ajst-30556	1	87	,	,	PUNCT
ajst-30556	1	88	southwest	southwest	PROPN
ajst-30556	1	89	jiaotong	jiaotong	PROPN
ajst-30556	1	90	university	university	PROPN
ajst-30556	1	91	,	,	PUNCT
ajst-30556	1	92	chengdu	chengdu	PROPN
ajst-30556	1	93	611731	611731	PROPN
ajst-30556	1	94	,	,	PUNCT
ajst-30556	1	95	china	china	PROPN
ajst-30556	1	96	abstract	abstract	NOUN
ajst-30556	1	97	:	:	PUNCT
ajst-30556	1	98	to	to	PART
ajst-30556	1	99	address	address	VERB
ajst-30556	1	100	the	the	DET
ajst-30556	1	101	issue	issue	NOUN
ajst-30556	1	102	that	that	SCONJ
ajst-30556	1	103	existing	exist	VERB
ajst-30556	1	104	solution	solution	NOUN
ajst-30556	1	105	algorithms	algorithm	NOUN
ajst-30556	1	106	for	for	ADP
ajst-30556	1	107	continuous	continuous	ADJ
ajst-30556	1	108	distributed	distribute	VERB
ajst-30556	1	109	constraint	constraint	NOUN
ajst-30556	1	110	optimization	optimization	NOUN
ajst-30556	1	111	problems	problem	NOUN
ajst-30556	1	112	(	(	PUNCT
ajst-30556	1	113	c	c	NOUN
ajst-30556	1	114	-	-	PUNCT
ajst-30556	1	115	dcops	dcop	NOUN
ajst-30556	1	116	)	)	PUNCT
ajst-30556	1	117	are	be	AUX
ajst-30556	1	118	prone	prone	ADJ
ajst-30556	1	119	to	to	ADP
ajst-30556	1	120	getting	getting	AUX
ajst-30556	1	121	trapped	trap	VERB
ajst-30556	1	122	in	in	ADP
ajst-30556	1	123	local	local	ADJ
ajst-30556	1	124	optima	optima	NOUN
ajst-30556	1	125	and	and	CCONJ
ajst-30556	1	126	failing	fail	VERB
ajst-30556	1	127	to	to	PART
ajst-30556	1	128	escape	escape	VERB
ajst-30556	1	129	,	,	PUNCT
ajst-30556	1	130	this	this	DET
ajst-30556	1	131	paper	paper	NOUN
ajst-30556	1	132	proposes	propose	VERB
ajst-30556	1	133	a	a	DET
ajst-30556	1	134	c	c	NOUN
ajst-30556	1	135	-	-	PUNCT
ajst-30556	1	136	dcop	dcop	NOUN
ajst-30556	1	137	algorithm	algorithm	NOUN
ajst-30556	1	138	based	base	VERB
ajst-30556	1	139	on	on	ADP
ajst-30556	1	140	the	the	DET
ajst-30556	1	141	historical	historical	ADJ
ajst-30556	1	142	feature	feature	NOUN
ajst-30556	1	143	distribution	distribution	NOUN
ajst-30556	1	144	of	of	ADP
ajst-30556	1	145	agents	agent	NOUN
ajst-30556	1	146	(	(	PUNCT
ajst-30556	1	147	hfda	hfda	ADJ
ajst-30556	1	148	)	)	PUNCT
ajst-30556	1	149	.	.	PUNCT
ajst-30556	2	1	in	in	ADP
ajst-30556	2	2	hfda	hfda	PROPN
ajst-30556	2	3	,	,	PUNCT
ajst-30556	2	4	agents	agent	NOUN
ajst-30556	2	5	'	'	PART
ajst-30556	2	6	historical	historical	ADJ
ajst-30556	2	7	values	value	NOUN
ajst-30556	2	8	are	be	AUX
ajst-30556	2	9	utilized	utilize	VERB
ajst-30556	2	10	to	to	PART
ajst-30556	2	11	detect	detect	VERB
ajst-30556	2	12	when	when	SCONJ
ajst-30556	2	13	the	the	DET
ajst-30556	2	14	algorithm	algorithm	NOUN
ajst-30556	2	15	falls	fall	VERB
ajst-30556	2	16	into	into	ADP
ajst-30556	2	17	a	a	DET
ajst-30556	2	18	local	local	ADJ
ajst-30556	2	19	optimum	optimum	NOUN
ajst-30556	2	20	.	.	PUNCT
ajst-30556	3	1	upon	upon	SCONJ
ajst-30556	3	2	detection	detection	NOUN
ajst-30556	3	3	,	,	PUNCT
ajst-30556	3	4	the	the	DET
ajst-30556	3	5	historical	historical	ADJ
ajst-30556	3	6	features	feature	NOUN
ajst-30556	3	7	of	of	ADP
ajst-30556	3	8	neighboring	neighboring	NOUN
ajst-30556	3	9	agents	agent	NOUN
ajst-30556	3	10	are	be	AUX
ajst-30556	3	11	constructed	construct	VERB
ajst-30556	3	12	based	base	VERB
ajst-30556	3	13	on	on	ADP
ajst-30556	3	14	constraint	constraint	NOUN
ajst-30556	3	15	functions	function	NOUN
ajst-30556	3	16	.	.	PUNCT
ajst-30556	4	1	by	by	ADP
ajst-30556	4	2	leveraging	leverage	VERB
ajst-30556	4	3	the	the	DET
ajst-30556	4	4	distribution	distribution	NOUN
ajst-30556	4	5	of	of	ADP
ajst-30556	4	6	these	these	DET
ajst-30556	4	7	features	feature	NOUN
ajst-30556	4	8	,	,	PUNCT
ajst-30556	4	9	a	a	DET
ajst-30556	4	10	probabilistic	probabilistic	ADJ
ajst-30556	4	11	constraint	constraint	NOUN
ajst-30556	4	12	selection	selection	NOUN
ajst-30556	4	13	mechanism	mechanism	NOUN
ajst-30556	4	14	is	be	AUX
ajst-30556	4	15	introduced	introduce	VERB
ajst-30556	4	16	to	to	PART
ajst-30556	4	17	explore	explore	VERB
ajst-30556	4	18	new	new	ADJ
ajst-30556	4	19	solutions	solution	NOUN
ajst-30556	4	20	that	that	PRON
ajst-30556	4	21	can	can	AUX
ajst-30556	4	22	not	not	PART
ajst-30556	4	23	be	be	AUX
ajst-30556	4	24	obtained	obtain	VERB
ajst-30556	4	25	under	under	ADP
ajst-30556	4	26	full	full	ADJ
ajst-30556	4	27	constraints	constraint	NOUN
ajst-30556	4	28	,	,	PUNCT
ajst-30556	4	29	thereby	thereby	ADV
ajst-30556	4	30	guiding	guide	VERB
ajst-30556	4	31	the	the	DET
ajst-30556	4	32	algorithm	algorithm	NOUN
ajst-30556	4	33	towards	towards	ADP
ajst-30556	4	34	optimization	optimization	NOUN
ajst-30556	4	35	and	and	CCONJ
ajst-30556	4	36	overcoming	overcome	VERB
ajst-30556	4	37	local	local	ADJ
ajst-30556	4	38	optima	optima	NOUN
ajst-30556	4	39	or	or	CCONJ
ajst-30556	4	40	stagnation	stagnation	NOUN
ajst-30556	4	41	.	.	PUNCT
ajst-30556	5	1	the	the	DET
ajst-30556	5	2	probabilistic	probabilistic	ADJ
ajst-30556	5	3	neglect	neglect	NOUN
ajst-30556	5	4	of	of	ADP
ajst-30556	5	5	neighbors	neighbor	NOUN
ajst-30556	5	6	based	base	VERB
ajst-30556	5	7	on	on	ADP
ajst-30556	5	8	their	their	PRON
ajst-30556	5	9	feature	feature	NOUN
ajst-30556	5	10	distribution	distribution	NOUN
ajst-30556	5	11	increases	increase	VERB
ajst-30556	5	12	the	the	DET
ajst-30556	5	13	chances	chance	NOUN
ajst-30556	5	14	of	of	ADP
ajst-30556	5	15	finding	find	VERB
ajst-30556	5	16	better	well	ADJ
ajst-30556	5	17	solutions	solution	NOUN
ajst-30556	5	18	while	while	SCONJ
ajst-30556	5	19	effectively	effectively	ADV
ajst-30556	5	20	suppressing	suppress	VERB
ajst-30556	5	21	noise	noise	NOUN
ajst-30556	5	22	.	.	PUNCT
ajst-30556	6	1	comparative	comparative	ADJ
ajst-30556	6	2	experiments	experiment	NOUN
ajst-30556	6	3	on	on	ADP
ajst-30556	6	4	two	two	NUM
ajst-30556	6	5	benchmark	benchmark	NOUN
ajst-30556	6	6	problems	problem	NOUN
ajst-30556	6	7	demonstrate	demonstrate	VERB
ajst-30556	6	8	that	that	SCONJ
ajst-30556	6	9	hfda	hfda	PROPN
ajst-30556	6	10	achieves	achieve	VERB
ajst-30556	6	11	faster	fast	ADJ
ajst-30556	6	12	convergence	convergence	NOUN
ajst-30556	6	13	and	and	CCONJ
ajst-30556	6	14	higher	high	ADJ
ajst-30556	6	15	solution	solution	NOUN
ajst-30556	6	16	quality	quality	NOUN
ajst-30556	6	17	compared	compare	VERB
ajst-30556	6	18	to	to	ADP
ajst-30556	6	19	state	state	NOUN
ajst-30556	6	20	-	-	PUNCT
ajst-30556	6	21	of	of	ADP
ajst-30556	6	22	-	-	PUNCT
ajst-30556	6	23	the	the	DET
ajst-30556	6	24	-	-	PUNCT
ajst-30556	6	25	art	art	NOUN
ajst-30556	6	26	c	c	NOUN
ajst-30556	6	27	-	-	PUNCT
ajst-30556	6	28	dcop	dcop	NOUN
ajst-30556	6	29	algorithms	algorithm	NOUN
ajst-30556	6	30	.	.	PUNCT
ajst-30556	7	1	keywords	keyword	NOUN
ajst-30556	7	2	:	:	PUNCT
ajst-30556	7	3	multi	multi	ADJ
ajst-30556	7	4	-	-	ADJ
ajst-30556	7	5	agent	agent	ADJ
ajst-30556	7	6	system	system	NOUN
ajst-30556	7	7	;	;	PUNCT
ajst-30556	7	8	continuous	continuous	ADJ
ajst-30556	7	9	distributed	distribute	VERB
ajst-30556	7	10	constraint	constraint	NOUN
ajst-30556	7	11	optimization	optimization	NOUN
ajst-30556	7	12	problems	problem	NOUN
ajst-30556	7	13	;	;	PUNCT
ajst-30556	7	14	neighbor	neighbor	NOUN
ajst-30556	7	15	feature	feature	NOUN
ajst-30556	7	16	distribution	distribution	NOUN
ajst-30556	7	17	;	;	PUNCT
ajst-30556	7	18	neglect	neglect	NOUN
ajst-30556	7	19	strategy	strategy	NOUN
ajst-30556	7	20	.	.	PUNCT
ajst-30556	8	1	1	1	X
ajst-30556	8	2	.	.	X
ajst-30556	8	3	introduction	introduction	NOUN
ajst-30556	8	4	multi	multi	ADJ
ajst-30556	8	5	-	-	ADJ
ajst-30556	8	6	agent	agent	ADJ
ajst-30556	8	7	systems	system	NOUN
ajst-30556	8	8	(	(	PUNCT
ajst-30556	8	9	mas)[1	mas)[1	PROPN
ajst-30556	8	10	]	]	PUNCT
ajst-30556	8	11	represent	represent	VERB
ajst-30556	8	12	a	a	DET
ajst-30556	8	13	significant	significant	ADJ
ajst-30556	8	14	branch	branch	NOUN
ajst-30556	8	15	of	of	ADP
ajst-30556	8	16	distributed	distribute	VERB
ajst-30556	8	17	artificial	artificial	ADJ
ajst-30556	8	18	intelligence	intelligence	NOUN
ajst-30556	8	19	research	research	NOUN
ajst-30556	8	20	.	.	PUNCT
ajst-30556	9	1	as	as	ADP
ajst-30556	9	2	a	a	DET
ajst-30556	9	3	fundamental	fundamental	ADJ
ajst-30556	9	4	abstraction	abstraction	NOUN
ajst-30556	9	5	framework	framework	NOUN
ajst-30556	9	6	for	for	ADP
ajst-30556	9	7	agent	agent	NOUN
ajst-30556	9	8	collaboration	collaboration	NOUN
ajst-30556	9	9	,	,	PUNCT
ajst-30556	9	10	distributed	distribute	VERB
ajst-30556	9	11	constraint	constraint	NOUN
ajst-30556	9	12	optimization	optimization	NOUN
ajst-30556	9	13	problems	problem	NOUN
ajst-30556	9	14	(	(	PUNCT
ajst-30556	9	15	dcops	dcop	NOUN
ajst-30556	9	16	)	)	PUNCT
ajst-30556	10	1	[	[	X
ajst-30556	10	2	2	2	NUM
ajst-30556	10	3	]	]	PUNCT
ajst-30556	10	4	serve	serve	VERB
ajst-30556	10	5	as	as	ADP
ajst-30556	10	6	a	a	DET
ajst-30556	10	7	key	key	ADJ
ajst-30556	10	8	technique	technique	NOUN
ajst-30556	10	9	for	for	ADP
ajst-30556	10	10	constraint	constraint	NOUN
ajst-30556	10	11	modeling	modeling	NOUN
ajst-30556	10	12	and	and	CCONJ
ajst-30556	10	13	cooperative	cooperative	ADJ
ajst-30556	10	14	optimization	optimization	NOUN
ajst-30556	10	15	in	in	ADP
ajst-30556	10	16	multi	multi	ADJ
ajst-30556	10	17	-	-	ADJ
ajst-30556	10	18	agent	agent	ADJ
ajst-30556	10	19	systems	system	NOUN
ajst-30556	10	20	.	.	PUNCT
ajst-30556	11	1	by	by	ADP
ajst-30556	11	2	leveraging	leverage	VERB
ajst-30556	11	3	inter	inter	ADJ
ajst-30556	11	4	-	-	ADJ
ajst-30556	11	5	agent	agent	ADJ
ajst-30556	11	6	communication	communication	NOUN
ajst-30556	11	7	to	to	PART
ajst-30556	11	8	achieve	achieve	VERB
ajst-30556	11	9	global	global	ADJ
ajst-30556	11	10	cost	cost	NOUN
ajst-30556	11	11	optimization	optimization	NOUN
ajst-30556	11	12	,	,	PUNCT
ajst-30556	11	13	dcops	dcop	NOUN
ajst-30556	11	14	exhibit	exhibit	VERB
ajst-30556	11	15	strong	strong	ADJ
ajst-30556	11	16	fault	fault	NOUN
ajst-30556	11	17	tolerance	tolerance	NOUN
ajst-30556	11	18	and	and	CCONJ
ajst-30556	11	19	high	high	ADJ
ajst-30556	11	20	parallelism	parallelism	NOUN
ajst-30556	11	21	,	,	PUNCT
ajst-30556	11	22	making	make	VERB
ajst-30556	11	23	them	they	PRON
ajst-30556	11	24	well	well	ADV
ajst-30556	11	25	-	-	PUNCT
ajst-30556	11	26	suited	suit	VERB
ajst-30556	11	27	for	for	ADP
ajst-30556	11	28	large	large	ADJ
ajst-30556	11	29	-	-	PUNCT
ajst-30556	11	30	scale	scale	NOUN
ajst-30556	11	31	and	and	CCONJ
ajst-30556	11	32	complex	complex	ADJ
ajst-30556	11	33	problems	problem	NOUN
ajst-30556	11	34	that	that	PRON
ajst-30556	11	35	require	require	VERB
ajst-30556	11	36	efficient	efficient	ADJ
ajst-30556	11	37	distributed	distribute	VERB
ajst-30556	11	38	computing	computing	NOUN
ajst-30556	11	39	.	.	PUNCT
ajst-30556	12	1	currently	currently	ADV
ajst-30556	12	2	,	,	PUNCT
ajst-30556	12	3	dcops	dcop	NOUN
ajst-30556	12	4	have	have	AUX
ajst-30556	12	5	been	be	AUX
ajst-30556	12	6	widely	widely	ADV
ajst-30556	12	7	applied	apply	VERB
ajst-30556	12	8	in	in	ADP
ajst-30556	12	9	various	various	ADJ
ajst-30556	12	10	domains	domain	NOUN
ajst-30556	12	11	,	,	PUNCT
ajst-30556	12	12	such	such	ADJ
ajst-30556	12	13	as	as	ADP
ajst-30556	12	14	task	task	NOUN
ajst-30556	12	15	scheduling	scheduling	NOUN
ajst-30556	12	16	[	[	X
ajst-30556	12	17	3	3	NUM
ajst-30556	12	18	]	]	PUNCT
ajst-30556	12	19	and	and	CCONJ
ajst-30556	12	20	sensor	sensor	NOUN
ajst-30556	12	21	networks	network	NOUN
ajst-30556	12	22	[	[	X
ajst-30556	12	23	4	4	NUM
ajst-30556	12	24	]	]	PUNCT
ajst-30556	12	25	.	.	PUNCT
ajst-30556	13	1	traditional	traditional	ADJ
ajst-30556	13	2	dcops	dcop	NOUN
ajst-30556	13	3	assume	assume	VERB
ajst-30556	13	4	that	that	SCONJ
ajst-30556	13	5	problem	problem	NOUN
ajst-30556	13	6	variables	variable	NOUN
ajst-30556	13	7	are	be	AUX
ajst-30556	13	8	discrete	discrete	ADJ
ajst-30556	13	9	.	.	PUNCT
ajst-30556	14	1	however	however	ADV
ajst-30556	14	2	,	,	PUNCT
ajst-30556	14	3	certain	certain	ADJ
ajst-30556	14	4	real	real	ADJ
ajst-30556	14	5	-	-	PUNCT
ajst-30556	14	6	world	world	NOUN
ajst-30556	14	7	applications	application	NOUN
ajst-30556	14	8	,	,	PUNCT
ajst-30556	14	9	such	such	ADJ
ajst-30556	14	10	as	as	ADP
ajst-30556	14	11	the	the	DET
ajst-30556	14	12	sleep	sleep	NOUN
ajst-30556	14	13	scheduling	scheduling	NOUN
ajst-30556	14	14	of	of	ADP
ajst-30556	14	15	wireless	wireless	ADJ
ajst-30556	14	16	sensor	sensor	NOUN
ajst-30556	14	17	networks	network	NOUN
ajst-30556	14	18	[	[	X
ajst-30556	14	19	5	5	NUM
ajst-30556	14	20	]	]	PUNCT
ajst-30556	14	21	,	,	PUNCT
ajst-30556	14	22	are	be	AUX
ajst-30556	14	23	better	well	ADV
ajst-30556	14	24	suited	suited	ADJ
ajst-30556	14	25	for	for	ADP
ajst-30556	14	26	continuous	continuous	ADJ
ajst-30556	14	27	-	-	PUNCT
ajst-30556	14	28	variable	variable	ADJ
ajst-30556	14	29	modeling	modeling	NOUN
ajst-30556	14	30	.	.	PUNCT
ajst-30556	15	1	to	to	PART
ajst-30556	15	2	overcome	overcome	VERB
ajst-30556	15	3	this	this	DET
ajst-30556	15	4	limitation	limitation	NOUN
ajst-30556	15	5	,	,	PUNCT
ajst-30556	15	6	continuous	continuous	ADJ
ajst-30556	15	7	distributed	distribute	VERB
ajst-30556	15	8	constraint	constraint	NOUN
ajst-30556	15	9	optimization	optimization	NOUN
ajst-30556	15	10	problems	problem	NOUN
ajst-30556	15	11	(	(	PUNCT
ajst-30556	15	12	c	c	NOUN
ajst-30556	15	13	-	-	PUNCT
ajst-30556	15	14	dcops	dcop	NOUN
ajst-30556	15	15	)	)	PUNCT
ajst-30556	16	1	[	[	X
ajst-30556	16	2	6	6	NUM
ajst-30556	16	3	]	]	PUNCT
ajst-30556	16	4	were	be	AUX
ajst-30556	16	5	introduced	introduce	VERB
ajst-30556	16	6	,	,	PUNCT
ajst-30556	16	7	extending	extend	VERB
ajst-30556	16	8	dcops	dcop	NOUN
ajst-30556	16	9	to	to	PART
ajst-30556	16	10	handle	handle	VERB
ajst-30556	16	11	continuous	continuous	ADJ
ajst-30556	16	12	domains	domain	NOUN
ajst-30556	16	13	.	.	PUNCT
ajst-30556	17	1	several	several	ADJ
ajst-30556	17	2	innovative	innovative	ADJ
ajst-30556	17	3	algorithms	algorithm	NOUN
ajst-30556	17	4	have	have	AUX
ajst-30556	17	5	been	be	AUX
ajst-30556	17	6	developed	develop	VERB
ajst-30556	17	7	to	to	PART
ajst-30556	17	8	solve	solve	VERB
ajst-30556	17	9	c	c	NOUN
ajst-30556	17	10	-	-	PUNCT
ajst-30556	17	11	dcops	dcop	NOUN
ajst-30556	17	12	.	.	PUNCT
ajst-30556	18	1	for	for	ADP
ajst-30556	18	2	instance	instance	NOUN
ajst-30556	18	3	,	,	PUNCT
ajst-30556	18	4	continuous	continuous	ADJ
ajst-30556	18	5	max	max	PROPN
ajst-30556	18	6	-	-	PUNCT
ajst-30556	18	7	sum	sum	NOUN
ajst-30556	18	8	(	(	PUNCT
ajst-30556	18	9	cms	cms	NOUN
ajst-30556	18	10	)	)	PUNCT
ajst-30556	19	1	[	[	X
ajst-30556	19	2	7	7	X
ajst-30556	19	3	]	]	PUNCT
ajst-30556	19	4	approximates	approximate	VERB
ajst-30556	19	5	complex	complex	ADJ
ajst-30556	19	6	constraint	constraint	NOUN
ajst-30556	19	7	utility	utility	NOUN
ajst-30556	19	8	functions	function	NOUN
ajst-30556	19	9	using	use	VERB
ajst-30556	19	10	piecewise	piecewise	NOUN
ajst-30556	19	11	linear	linear	NOUN
ajst-30556	19	12	functions	function	NOUN
ajst-30556	19	13	.	.	PUNCT
ajst-30556	20	1	however	however	ADV
ajst-30556	20	2	,	,	PUNCT
ajst-30556	20	3	cms	cms	PROPN
ajst-30556	20	4	suffers	suffer	VERB
ajst-30556	20	5	from	from	ADP
ajst-30556	20	6	practical	practical	ADJ
ajst-30556	20	7	limitations	limitation	NOUN
ajst-30556	20	8	due	due	ADP
ajst-30556	20	9	to	to	ADP
ajst-30556	20	10	its	its	PRON
ajst-30556	20	11	restrictive	restrictive	ADJ
ajst-30556	20	12	applicability	applicability	NOUN
ajst-30556	20	13	.	.	PUNCT
ajst-30556	21	1	to	to	PART
ajst-30556	21	2	address	address	VERB
ajst-30556	21	3	these	these	DET
ajst-30556	21	4	shortcomings	shortcoming	NOUN
ajst-30556	21	5	,	,	PUNCT
ajst-30556	21	6	the	the	DET
ajst-30556	21	7	hybrid	hybrid	ADJ
ajst-30556	21	8	cms	cms	PROPN
ajst-30556	21	9	(	(	PUNCT
ajst-30556	21	10	hcms	hcms	NOUN
ajst-30556	21	11	)	)	PUNCT
ajst-30556	22	1	[	[	X
ajst-30556	22	2	8	8	NUM
ajst-30556	22	3	]	]	X
ajst-30556	22	4	algorithm	algorithm	NOUN
ajst-30556	22	5	was	be	AUX
ajst-30556	22	6	proposed	propose	VERB
ajst-30556	22	7	,	,	PUNCT
ajst-30556	22	8	integrating	integrate	VERB
ajst-30556	22	9	the	the	DET
ajst-30556	22	10	discrete	discrete	ADJ
ajst-30556	22	11	max	max	ADJ
ajst-30556	22	12	-	-	PUNCT
ajst-30556	22	13	sum	sum	NOUN
ajst-30556	22	14	framework	framework	NOUN
ajst-30556	22	15	with	with	ADP
ajst-30556	22	16	continuous	continuous	ADJ
ajst-30556	22	17	nonlinear	nonlinear	ADJ
ajst-30556	22	18	optimization	optimization	NOUN
ajst-30556	22	19	techniques	technique	NOUN
ajst-30556	22	20	.	.	PUNCT
ajst-30556	23	1	additionally	additionally	ADV
ajst-30556	23	2	,	,	PUNCT
ajst-30556	23	3	algorithms	algorithm	NOUN
ajst-30556	23	4	such	such	ADJ
ajst-30556	23	5	as	as	ADP
ajst-30556	23	6	exact	exact	ADJ
ajst-30556	23	7	function	function	NOUN
ajst-30556	23	8	dpop	dpop	NOUN
ajst-30556	23	9	(	(	PUNCT
ajst-30556	23	10	ef	ef	NOUN
ajst-30556	23	11	-	-	PUNCT
ajst-30556	23	12	dpop	dpop	NOUN
ajst-30556	23	13	)	)	PUNCT
ajst-30556	23	14	and	and	CCONJ
ajst-30556	23	15	approximate	approximate	ADJ
ajst-30556	23	16	function	function	NOUN
ajst-30556	23	17	dpop	dpop	NOUN
ajst-30556	23	18	(	(	PUNCT
ajst-30556	23	19	af	af	NOUN
ajst-30556	23	20	-	-	PUNCT
ajst-30556	23	21	dpop	dpop	NOUN
ajst-30556	23	22	)	)	PUNCT
ajst-30556	24	1	[	[	X
ajst-30556	24	2	9	9	NUM
ajst-30556	24	3	]	]	PUNCT
ajst-30556	24	4	have	have	AUX
ajst-30556	24	5	been	be	AUX
ajst-30556	24	6	introduced	introduce	VERB
ajst-30556	24	7	for	for	ADP
ajst-30556	24	8	solving	solve	VERB
ajst-30556	24	9	c	c	NOUN
ajst-30556	24	10	-	-	PUNCT
ajst-30556	24	11	dcops	dcop	NOUN
ajst-30556	24	12	.	.	PUNCT
ajst-30556	25	1	however	however	ADV
ajst-30556	25	2	,	,	PUNCT
ajst-30556	25	3	they	they	PRON
ajst-30556	25	4	still	still	ADV
ajst-30556	25	5	encounter	encounter	VERB
ajst-30556	25	6	challenges	challenge	NOUN
ajst-30556	25	7	related	relate	VERB
ajst-30556	25	8	to	to	ADP
ajst-30556	25	9	exponential	exponential	ADJ
ajst-30556	25	10	memory	memory	NOUN
ajst-30556	25	11	and	and	CCONJ
ajst-30556	25	12	computational	computational	ADJ
ajst-30556	25	13	complexity	complexity	NOUN
ajst-30556	25	14	.	.	PUNCT
ajst-30556	26	1	to	to	PART
ajst-30556	26	2	mitigate	mitigate	VERB
ajst-30556	26	3	memory	memory	NOUN
ajst-30556	26	4	and	and	CCONJ
ajst-30556	26	5	computational	computational	ADJ
ajst-30556	26	6	overhead	overhead	NOUN
ajst-30556	26	7	,	,	PUNCT
ajst-30556	26	8	choudhury	choudhury	PROPN
ajst-30556	26	9	et	et	PROPN
ajst-30556	26	10	al	al	PROPN
ajst-30556	27	1	[	[	X
ajst-30556	27	2	10	10	NUM
ajst-30556	27	3	]	]	PUNCT
ajst-30556	27	4	proposed	propose	VERB
ajst-30556	27	5	the	the	DET
ajst-30556	27	6	f	f	NOUN
ajst-30556	27	7	-	-	PUNCT
ajst-30556	27	8	dcop	dcop	NOUN
ajst-30556	27	9	algorithm	algorithm	NOUN
ajst-30556	27	10	based	base	VERB
ajst-30556	27	11	on	on	ADP
ajst-30556	27	12	particle	particle	NOUN
ajst-30556	27	13	swarm	swarm	NOUN
ajst-30556	27	14	optimization	optimization	NOUN
ajst-30556	27	15	(	(	PUNCT
ajst-30556	27	16	pfd	pfd	PROPN
ajst-30556	27	17	)	)	PUNCT
ajst-30556	27	18	,	,	PUNCT
ajst-30556	27	19	a	a	DET
ajst-30556	27	20	distributed	distribute	VERB
ajst-30556	27	21	variant	variant	NOUN
ajst-30556	27	22	of	of	ADP
ajst-30556	27	23	pso	pso	NOUN
ajst-30556	27	24	.	.	PUNCT
ajst-30556	28	1	however	however	ADV
ajst-30556	28	2	,	,	PUNCT
ajst-30556	28	3	due	due	ADP
ajst-30556	28	4	to	to	ADP
ajst-30556	28	5	its	its	PRON
ajst-30556	28	6	lack	lack	NOUN
ajst-30556	28	7	of	of	ADP
ajst-30556	28	8	population	population	NOUN
ajst-30556	28	9	diversity	diversity	NOUN
ajst-30556	28	10	,	,	PUNCT
ajst-30556	28	11	pfd	pfd	PROPN
ajst-30556	28	12	suffers	suffer	VERB
ajst-30556	28	13	from	from	ADP
ajst-30556	28	14	poor	poor	ADJ
ajst-30556	28	15	search	search	NOUN
ajst-30556	28	16	capability	capability	NOUN
ajst-30556	28	17	and	and	CCONJ
ajst-30556	28	18	is	be	AUX
ajst-30556	28	19	prone	prone	ADJ
ajst-30556	28	20	to	to	ADP
ajst-30556	28	21	local	local	ADJ
ajst-30556	28	22	optima	optima	NOUN
ajst-30556	28	23	.	.	PUNCT
ajst-30556	29	1	to	to	PART
ajst-30556	29	2	overcome	overcome	VERB
ajst-30556	29	3	these	these	DET
ajst-30556	29	4	limitations	limitation	NOUN
ajst-30556	29	5	,	,	PUNCT
ajst-30556	29	6	shi	shi	PROPN
ajst-30556	29	7	et	et	PROPN
ajst-30556	29	8	al[11	al[11	PROPN
ajst-30556	29	9	]	]	PUNCT
ajst-30556	29	10	introduced	introduce	VERB
ajst-30556	29	11	an	an	DET
ajst-30556	29	12	improved	improved	ADJ
ajst-30556	29	13	version	version	NOUN
ajst-30556	29	14	,	,	PUNCT
ajst-30556	29	15	pfd	pfd	PROPN
ajst-30556	29	16	-	-	PUNCT
ajst-30556	29	17	ld	ld	PROPN
ajst-30556	29	18	,	,	PUNCT
ajst-30556	29	19	which	which	PRON
ajst-30556	29	20	incorporates	incorporate	VERB
ajst-30556	29	21	local	local	ADJ
ajst-30556	29	22	decision	decision	NOUN
ajst-30556	29	23	-	-	PUNCT
ajst-30556	29	24	making	making	NOUN
ajst-30556	29	25	to	to	PART
ajst-30556	29	26	reduce	reduce	VERB
ajst-30556	29	27	dependency	dependency	NOUN
ajst-30556	29	28	on	on	ADP
ajst-30556	29	29	root	root	NOUN
ajst-30556	29	30	agents	agent	NOUN
ajst-30556	29	31	.	.	PUNCT
ajst-30556	30	1	the	the	DET
ajst-30556	30	2	continuous	continuous	ADJ
ajst-30556	30	3	cooperative	cooperative	ADJ
ajst-30556	30	4	constraint	constraint	NOUN
ajst-30556	30	5	approximation	approximation	NOUN
ajst-30556	30	6	(	(	PUNCT
ajst-30556	30	7	c	c	NOUN
ajst-30556	30	8	-	-	PUNCT
ajst-30556	30	9	cocoa	cocoa	NOUN
ajst-30556	30	10	)	)	PUNCT
ajst-30556	30	11	algorithm	algorithm	NOUN
ajst-30556	31	1	[	[	X
ajst-30556	31	2	12	12	NUM
ajst-30556	31	3	]	]	PUNCT
ajst-30556	31	4	employs	employ	VERB
ajst-30556	31	5	continuous	continuous	ADJ
ajst-30556	31	6	nonlinear	nonlinear	ADJ
ajst-30556	31	7	optimization	optimization	NOUN
ajst-30556	31	8	techniques	technique	NOUN
ajst-30556	31	9	to	to	PART
ajst-30556	31	10	enable	enable	VERB
ajst-30556	31	11	rapid	rapid	ADJ
ajst-30556	31	12	convergence	convergence	NOUN
ajst-30556	31	13	and	and	CCONJ
ajst-30556	31	14	lower	low	ADJ
ajst-30556	31	15	computational	computational	ADJ
ajst-30556	31	16	costs	cost	NOUN
ajst-30556	31	17	.	.	PUNCT
ajst-30556	32	1	however	however	ADV
ajst-30556	32	2	,	,	PUNCT
ajst-30556	32	3	ccocoa	ccocoa	PROPN
ajst-30556	32	4	is	be	AUX
ajst-30556	32	5	highly	highly	ADV
ajst-30556	32	6	sensitive	sensitive	ADJ
ajst-30556	32	7	to	to	ADP
ajst-30556	32	8	initialization	initialization	NOUN
ajst-30556	32	9	parameters	parameter	NOUN
ajst-30556	32	10	,	,	PUNCT
ajst-30556	32	11	resulting	result	VERB
ajst-30556	32	12	in	in	ADP
ajst-30556	32	13	unstable	unstable	ADJ
ajst-30556	32	14	performance	performance	NOUN
ajst-30556	32	15	and	and	CCONJ
ajst-30556	32	16	difficulty	difficulty	NOUN
ajst-30556	32	17	in	in	ADP
ajst-30556	32	18	handling	handle	VERB
ajst-30556	32	19	large	large	ADJ
ajst-30556	32	20	-	-	PUNCT
ajst-30556	32	21	scale	scale	NOUN
ajst-30556	32	22	problems	problem	NOUN
ajst-30556	32	23	.	.	PUNCT
ajst-30556	33	1	yu	yu	PROPN
ajst-30556	33	2	et	et	PROPN
ajst-30556	33	3	al[13	al[13	PROPN
ajst-30556	33	4	]	]	PUNCT
ajst-30556	33	5	proposed	propose	VERB
ajst-30556	33	6	the	the	DET
ajst-30556	33	7	partial	partial	ADJ
ajst-30556	33	8	decision	decision	NOUN
ajst-30556	33	9	scheme	scheme	NOUN
ajst-30556	33	10	(	(	PUNCT
ajst-30556	33	11	pds	pds	NOUN
ajst-30556	33	12	)	)	PUNCT
ajst-30556	33	13	,	,	PUNCT
ajst-30556	33	14	which	which	PRON
ajst-30556	33	15	improves	improve	VERB
ajst-30556	33	16	local	local	ADJ
ajst-30556	33	17	agent	agent	NOUN
ajst-30556	33	18	utility	utility	NOUN
ajst-30556	33	19	by	by	ADP
ajst-30556	33	20	selectively	selectively	ADV
ajst-30556	33	21	ignoring	ignore	VERB
ajst-30556	33	22	certain	certain	ADJ
ajst-30556	33	23	neighbors	neighbor	NOUN
ajst-30556	33	24	.	.	PUNCT
ajst-30556	34	1	nevertheless	nevertheless	ADV
ajst-30556	34	2	,	,	PUNCT
ajst-30556	34	3	in	in	ADP
ajst-30556	34	4	large	large	ADJ
ajst-30556	34	5	-	-	PUNCT
ajst-30556	34	6	scale	scale	NOUN
ajst-30556	34	7	and	and	CCONJ
ajst-30556	34	8	high	high	ADJ
ajst-30556	34	9	-	-	PUNCT
ajst-30556	34	10	density	density	NOUN
ajst-30556	34	11	settings	setting	NOUN
ajst-30556	34	12	,	,	PUNCT
ajst-30556	34	13	pds	pds	NOUN
ajst-30556	34	14	's	's	PART
ajst-30556	34	15	single	single	ADJ
ajst-30556	34	16	-	-	PUNCT
ajst-30556	34	17	agent	agent	NOUN
ajst-30556	34	18	neglect	neglect	NOUN
ajst-30556	34	19	strategy	strategy	NOUN
ajst-30556	34	20	weakens	weaken	VERB
ajst-30556	34	21	its	its	PRON
ajst-30556	34	22	effectiveness	effectiveness	NOUN
ajst-30556	34	23	,	,	PUNCT
ajst-30556	34	24	limiting	limit	VERB
ajst-30556	34	25	further	further	ADJ
ajst-30556	34	26	optimization	optimization	NOUN
ajst-30556	34	27	.	.	PUNCT
ajst-30556	35	1	given	give	VERB
ajst-30556	35	2	the	the	DET
ajst-30556	35	3	aforementioned	aforementioned	ADJ
ajst-30556	35	4	challenges	challenge	NOUN
ajst-30556	35	5	,	,	PUNCT
ajst-30556	35	6	getting	getting	AUX
ajst-30556	35	7	trapped	trap	VERB
ajst-30556	35	8	in	in	ADP
ajst-30556	35	9	local	local	ADJ
ajst-30556	35	10	optima	optima	NOUN
ajst-30556	35	11	is	be	AUX
ajst-30556	35	12	a	a	DET
ajst-30556	35	13	common	common	ADJ
ajst-30556	35	14	and	and	CCONJ
ajst-30556	35	15	often	often	ADV
ajst-30556	35	16	unavoidable	unavoidable	ADJ
ajst-30556	35	17	issue	issue	NOUN
ajst-30556	35	18	across	across	ADP
ajst-30556	35	19	most	most	ADJ
ajst-30556	35	20	algorithms	algorithm	NOUN
ajst-30556	35	21	.	.	PUNCT
ajst-30556	36	1	therefore	therefore	ADV
ajst-30556	36	2	,	,	PUNCT
ajst-30556	36	3	designing	design	VERB
ajst-30556	36	4	an	an	DET
ajst-30556	36	5	algorithm	algorithm	NOUN
ajst-30556	36	6	that	that	PRON
ajst-30556	36	7	can	can	AUX
ajst-30556	36	8	escape	escape	VERB
ajst-30556	36	9	local	local	ADJ
ajst-30556	36	10	optima	optima	NOUN
ajst-30556	36	11	and	and	CCONJ
ajst-30556	36	12	explore	explore	VERB
ajst-30556	36	13	new	new	ADJ
ajst-30556	36	14	solution	solution	NOUN
ajst-30556	36	15	spaces	space	NOUN
ajst-30556	36	16	remains	remain	VERB
ajst-30556	36	17	an	an	DET
ajst-30556	36	18	important	important	ADJ
ajst-30556	36	19	research	research	NOUN
ajst-30556	36	20	challenge	challenge	NOUN
ajst-30556	36	21	.	.	PUNCT
ajst-30556	37	1	to	to	PART
ajst-30556	37	2	address	address	VERB
ajst-30556	37	3	the	the	DET
ajst-30556	37	4	optimization	optimization	NOUN
ajst-30556	37	5	difficulties	difficulty	NOUN
ajst-30556	37	6	of	of	ADP
ajst-30556	37	7	c	c	NOUN
ajst-30556	37	8	-	-	PUNCT
ajst-30556	37	9	dcops	dcop	NOUN
ajst-30556	37	10	in	in	ADP
ajst-30556	37	11	large	large	ADJ
ajst-30556	37	12	-	-	PUNCT
ajst-30556	37	13	scale	scale	NOUN
ajst-30556	37	14	and	and	CCONJ
ajst-30556	37	15	high	high	ADJ
ajst-30556	37	16	-	-	PUNCT
ajst-30556	37	17	density	density	NOUN
ajst-30556	37	18	configurations	configuration	NOUN
ajst-30556	37	19	,	,	PUNCT
ajst-30556	37	20	this	this	DET
ajst-30556	37	21	paper	paper	NOUN
ajst-30556	37	22	proposes	propose	VERB
ajst-30556	37	23	the	the	DET
ajst-30556	37	24	historical	historical	ADJ
ajst-30556	37	25	feature	feature	NOUN
ajst-30556	37	26	distribution	distribution	NOUN
ajst-30556	37	27	-	-	PUNCT
ajst-30556	37	28	based	base	VERB
ajst-30556	37	29	c	c	NOUN
ajst-30556	37	30	-	-	PUNCT
ajst-30556	37	31	dcop	dcop	NOUN
ajst-30556	37	32	algorithm	algorithm	NOUN
ajst-30556	37	33	(	(	PUNCT
ajst-30556	37	34	hfda	hfda	ADJ
ajst-30556	37	35	)	)	PUNCT
ajst-30556	37	36	.	.	PUNCT
ajst-30556	38	1	when	when	SCONJ
ajst-30556	38	2	encountering	encounter	VERB
ajst-30556	38	3	local	local	ADJ
ajst-30556	38	4	optima	optima	NOUN
ajst-30556	38	5	or	or	CCONJ
ajst-30556	38	6	stagnation	stagnation	NOUN
ajst-30556	38	7	,	,	PUNCT
ajst-30556	38	8	hfda	hfda	ADJ
ajst-30556	38	9	utilizes	utilizes	ADJ
ajst-30556	38	10	agents	agent	NOUN
ajst-30556	38	11	’	’	PART
ajst-30556	38	12	historical	historical	ADJ
ajst-30556	38	13	values	value	NOUN
ajst-30556	38	14	and	and	CCONJ
ajst-30556	38	15	constraint	constraint	NOUN
ajst-30556	38	16	relationships	relationship	NOUN
ajst-30556	38	17	with	with	ADP
ajst-30556	38	18	neighbors	neighbor	NOUN
ajst-30556	38	19	to	to	PART
ajst-30556	38	20	construct	construct	VERB
ajst-30556	38	21	influence	influence	NOUN
ajst-30556	38	22	distributions	distribution	NOUN
ajst-30556	38	23	.	.	PUNCT
ajst-30556	39	1	based	base	VERB
ajst-30556	39	2	on	on	ADP
ajst-30556	39	3	these	these	DET
ajst-30556	39	4	distributions	distribution	NOUN
ajst-30556	39	5	,	,	PUNCT
ajst-30556	39	6	selective	selective	ADJ
ajst-30556	39	7	neighbor	neighbor	NOUN
ajst-30556	39	8	value	value	NOUN
ajst-30556	39	9	neglect	neglect	NOUN
ajst-30556	39	10	is	be	AUX
ajst-30556	39	11	applied	apply	VERB
ajst-30556	39	12	to	to	PART
ajst-30556	39	13	expand	expand	VERB
ajst-30556	39	14	the	the	DET
ajst-30556	39	15	solution	solution	NOUN
ajst-30556	39	16	space	space	NOUN
ajst-30556	39	17	exploration	exploration	NOUN
ajst-30556	39	18	,	,	PUNCT
ajst-30556	39	19	thereby	thereby	ADV
ajst-30556	39	20	enhancing	enhance	VERB
ajst-30556	39	21	the	the	DET
ajst-30556	39	22	algorithm	algorithm	NOUN
ajst-30556	39	23	’s	’s	PART
ajst-30556	39	24	optimization	optimization	NOUN
ajst-30556	39	25	performance	performance	NOUN
ajst-30556	39	26	.	.	PUNCT
ajst-30556	40	1	244	244	NUM
ajst-30556	40	2	2	2	NUM
ajst-30556	40	3	.	.	PUNCT
ajst-30556	40	4	backgrounds	background	NOUN
ajst-30556	40	5	2.1	2.1	NUM
ajst-30556	40	6	.	.	PUNCT
ajst-30556	41	1	continuous	continuous	ADJ
ajst-30556	41	2	distributed	distribute	VERB
ajst-30556	41	3	constraint	constraint	NOUN
ajst-30556	41	4	problems	problem	NOUN
ajst-30556	41	5	a	a	DET
ajst-30556	41	6	continuous	continuous	ADJ
ajst-30556	41	7	distributed	distribute	VERB
ajst-30556	41	8	constraint	constraint	NOUN
ajst-30556	41	9	optimization	optimization	NOUN
ajst-30556	41	10	problems	problem	NOUN
ajst-30556	41	11	(	(	PUNCT
ajst-30556	41	12	c	c	NOUN
ajst-30556	41	13	-	-	PUNCT
ajst-30556	41	14	dcops	dcop	NOUN
ajst-30556	41	15	)	)	PUNCT
ajst-30556	41	16	are	be	AUX
ajst-30556	41	17	represented	represent	VERB
ajst-30556	41	18	as	as	ADP
ajst-30556	41	19	a	a	DET
ajst-30556	41	20	quintuple	quintuple	NOUN
ajst-30556	41	21	,	,	PUNCT
ajst-30556	41	22	,	,	PUNCT
ajst-30556	41	23	,	,	PUNCT
ajst-30556	41	24	,	,	PUNCT
ajst-30556	41	25	a	a	DET
ajst-30556	41	26	x	x	X
ajst-30556	41	27	d	d	X
ajst-30556	41	28	f	f	PROPN
ajst-30556	41	29	,	,	PUNCT
ajst-30556	41	30	where	where	SCONJ
ajst-30556	41	31	:	:	PUNCT
ajst-30556	41	32	1	1	NUM
ajst-30556	41	33	{	{	PUNCT
ajst-30556	41	34	,	,	PUNCT
ajst-30556	41	35	,	,	PUNCT
ajst-30556	41	36	}	}	PUNCT
ajst-30556	41	37	na	na	ADP
ajst-30556	41	38	a	a	DET
ajst-30556	41	39	a	a	NOUN
ajst-30556	41	40	,	,	PUNCT
ajst-30556	41	41	}	}	PUNCT
ajst-30556	41	42	n	n	CCONJ
ajst-30556	41	43	,	,	PUNCT
ajst-30556	41	44	is	be	AUX
ajst-30556	41	45	the	the	DET
ajst-30556	41	46	set	set	NOUN
ajst-30556	41	47	of	of	ADP
ajst-30556	41	48	agents	agent	NOUN
ajst-30556	41	49	.	.	PUNCT
ajst-30556	42	1	1	1	NUM
ajst-30556	42	2	{	{	PUNCT
ajst-30556	42	3	,	,	PUNCT
ajst-30556	42	4	,	,	PUNCT
ajst-30556	42	5	}	}	PUNCT
ajst-30556	42	6	nx	nx	NOUN
ajst-30556	42	7	x	x	SYM
ajst-30556	42	8	x	x	NOUN
ajst-30556	42	9	,	,	PUNCT
ajst-30556	42	10	}	}	PUNCT
ajst-30556	42	11	n	n	CCONJ
ajst-30556	42	12	,	,	PUNCT
ajst-30556	42	13	is	be	AUX
ajst-30556	42	14	the	the	DET
ajst-30556	42	15	set	set	NOUN
ajst-30556	42	16	of	of	ADP
ajst-30556	42	17	variables	variable	NOUN
ajst-30556	42	18	,	,	PUNCT
ajst-30556	42	19	each	each	PRON
ajst-30556	42	20	assigned	assign	VERB
ajst-30556	42	21	by	by	ADP
ajst-30556	42	22	its	its	PRON
ajst-30556	42	23	corresponding	corresponding	ADJ
ajst-30556	42	24	agent	agent	NOUN
ajst-30556	42	25	.	.	PUNCT
ajst-30556	43	1	each	each	DET
ajst-30556	43	2	agent	agent	NOUN
ajst-30556	43	3	is	be	AUX
ajst-30556	43	4	responsible	responsible	ADJ
ajst-30556	43	5	for	for	ADP
ajst-30556	43	6	assigning	assign	VERB
ajst-30556	43	7	values	value	NOUN
ajst-30556	43	8	to	to	ADP
ajst-30556	43	9	one	one	NUM
ajst-30556	43	10	or	or	CCONJ
ajst-30556	43	11	more	more	ADJ
ajst-30556	43	12	variables	variable	NOUN
ajst-30556	43	13	.	.	PUNCT
ajst-30556	44	1	1	1	NUM
ajst-30556	44	2	{	{	PUNCT
ajst-30556	44	3	,	,	PUNCT
ajst-30556	44	4	,	,	PUNCT
ajst-30556	44	5	}	}	PUNCT
ajst-30556	44	6	nd	nd	NOUN
ajst-30556	44	7	d	d	NOUN
ajst-30556	44	8	d	d	PROPN
ajst-30556	44	9	,	,	PUNCT
ajst-30556	44	10	}	}	PUNCT
ajst-30556	44	11	n	n	CCONJ
ajst-30556	44	12	,	,	PUNCT
ajst-30556	44	13	is	be	AUX
ajst-30556	44	14	the	the	DET
ajst-30556	44	15	set	set	NOUN
ajst-30556	44	16	of	of	ADP
ajst-30556	44	17	finite	finite	ADJ
ajst-30556	44	18	continuous	continuous	ADJ
ajst-30556	44	19	domains	domain	NOUN
ajst-30556	44	20	,	,	PUNCT
ajst-30556	44	21	where	where	SCONJ
ajst-30556	44	22	i	i	PRON
ajst-30556	44	23	d	d	PROPN
ajst-30556	44	24	represents	represent	VERB
ajst-30556	44	25	the	the	DET
ajst-30556	44	26	domain	domain	NOUN
ajst-30556	44	27	of	of	ADP
ajst-30556	44	28	variable	variable	NOUN
ajst-30556	44	29	ix	ix	ADV
ajst-30556	44	30	,	,	PUNCT
ajst-30556	44	31	with	with	ADP
ajst-30556	44	32	its	its	PRON
ajst-30556	44	33	lower	low	ADJ
ajst-30556	44	34	and	and	CCONJ
ajst-30556	44	35	upper	upper	ADJ
ajst-30556	44	36	bounds	bound	NOUN
ajst-30556	44	37	being	be	AUX
ajst-30556	44	38	[	[	PUNCT
ajst-30556	44	39	,	,	PUNCT
ajst-30556	44	40	]	]	X
ajst-30556	44	41	i	i	PRON
ajst-30556	44	42	ilb	ilb	VERB
ajst-30556	44	43	ub	ub	INTJ
ajst-30556	44	44	.	.	PUNCT
ajst-30556	45	1	1	1	NUM
ajst-30556	45	2	{	{	PUNCT
ajst-30556	45	3	,	,	PUNCT
ajst-30556	45	4	,	,	PUNCT
ajst-30556	45	5	}	}	PUNCT
ajst-30556	45	6	lf	lf	ADP
ajst-30556	45	7	f	f	PROPN
ajst-30556	45	8	f	f	PROPN
ajst-30556	45	9	,	,	PUNCT
ajst-30556	45	10	}	}	PUNCT
ajst-30556	45	11	l	l	NOUN
ajst-30556	45	12	,	,	PUNCT
ajst-30556	45	13	is	be	AUX
ajst-30556	45	14	a	a	DET
ajst-30556	45	15	set	set	NOUN
ajst-30556	45	16	of	of	ADP
ajst-30556	45	17	cost	cost	NOUN
ajst-30556	45	18	functions	function	NOUN
ajst-30556	45	19	,	,	PUNCT
ajst-30556	45	20	where	where	SCONJ
ajst-30556	45	21	each	each	DET
ajst-30556	45	22	function	function	NOUN
ajst-30556	45	23	f	f	PROPN
ajst-30556	45	24	f	f	PROPN
ajst-30556	45	25	is	be	AUX
ajst-30556	45	26	defined	define	VERB
ajst-30556	45	27	over	over	ADP
ajst-30556	45	28	a	a	DET
ajst-30556	45	29	subset	subset	NOUN
ajst-30556	45	30	of	of	ADP
ajst-30556	45	31	variables	variable	NOUN
ajst-30556	45	32	fx	fx	PROPN
ajst-30556	46	1	x	x	INTJ
ajst-30556	46	2	.	.	PUNCT
ajst-30556	47	1	it	it	PRON
ajst-30556	47	2	specifies	specify	VERB
ajst-30556	47	3	the	the	DET
ajst-30556	47	4	cost	cost	NOUN
ajst-30556	47	5	for	for	ADP
ajst-30556	47	6	every	every	DET
ajst-30556	47	7	possible	possible	ADJ
ajst-30556	47	8	value	value	NOUN
ajst-30556	47	9	assignment	assignment	NOUN
ajst-30556	47	10	of	of	ADP
ajst-30556	47	11	fx	fx	PROPN
ajst-30556	47	12	,	,	PUNCT
ajst-30556	47	13	i.e.	i.e.	X
ajst-30556	47	14	,	,	PUNCT
ajst-30556	47	15	:	:	PUNCT
ajst-30556	47	16	i	i	PRON
ajst-30556	47	17	i	i	VERB
ajst-30556	47	18	x	x	VERB
ajst-30556	48	1	x	x	PUNCT
ajst-30556	48	2	f	f	NOUN
ajst-30556	48	3	d	d	NOUN
ajst-30556	48	4	r	r	NOUN
ajst-30556	48	5	.	.	PUNCT
ajst-30556	49	1	in	in	ADP
ajst-30556	49	2	this	this	DET
ajst-30556	49	3	paper	paper	NOUN
ajst-30556	49	4	,	,	PUNCT
ajst-30556	49	5	for	for	ADP
ajst-30556	49	6	simplicity	simplicity	NOUN
ajst-30556	49	7	,	,	PUNCT
ajst-30556	49	8	only	only	ADV
ajst-30556	49	9	binary	binary	ADJ
ajst-30556	49	10	constraints	constraint	NOUN
ajst-30556	49	11	are	be	AUX
ajst-30556	49	12	considered	consider	VERB
ajst-30556	49	13	,	,	PUNCT
ajst-30556	49	14	meaning	mean	VERB
ajst-30556	49	15	2fx	2fx	NOUN
ajst-30556	49	16	.	.	PUNCT
ajst-30556	50	1	is	be	AUX
ajst-30556	50	2	a	a	DET
ajst-30556	50	3	mapping	mapping	NOUN
ajst-30556	50	4	function	function	NOUN
ajst-30556	50	5	that	that	PRON
ajst-30556	50	6	associates	associate	VERB
ajst-30556	50	7	variables	variable	NOUN
ajst-30556	50	8	with	with	ADP
ajst-30556	50	9	agents	agent	NOUN
ajst-30556	50	10	,	,	PUNCT
ajst-30556	50	11	representing	represent	VERB
ajst-30556	50	12	the	the	DET
ajst-30556	50	13	relationship	relationship	NOUN
ajst-30556	50	14	between	between	ADP
ajst-30556	50	15	a	a	DET
ajst-30556	50	16	continuous	continuous	ADJ
ajst-30556	50	17	variable	variable	NOUN
ajst-30556	50	18	ix	ix	ADV
ajst-30556	50	19	and	and	CCONJ
ajst-30556	50	20	an	an	DET
ajst-30556	50	21	agent	agent	NOUN
ajst-30556	50	22	ia	ia	NOUN
ajst-30556	50	23	.	.	PUNCT
ajst-30556	51	1	for	for	ADP
ajst-30556	51	2	ease	ease	NOUN
ajst-30556	51	3	of	of	ADP
ajst-30556	51	4	understanding	understanding	NOUN
ajst-30556	51	5	,	,	PUNCT
ajst-30556	51	6	agents	agent	NOUN
ajst-30556	51	7	and	and	CCONJ
ajst-30556	51	8	variables	variable	NOUN
ajst-30556	51	9	can	can	AUX
ajst-30556	51	10	be	be	AUX
ajst-30556	51	11	considered	consider	VERB
ajst-30556	51	12	equivalent	equivalent	ADJ
ajst-30556	51	13	concepts	concept	NOUN
ajst-30556	51	14	and	and	CCONJ
ajst-30556	51	15	are	be	AUX
ajst-30556	51	16	used	use	VERB
ajst-30556	51	17	interchangeably	interchangeably	ADV
ajst-30556	51	18	in	in	ADP
ajst-30556	51	19	this	this	DET
ajst-30556	51	20	paper	paper	NOUN
ajst-30556	51	21	.	.	PUNCT
ajst-30556	52	1	let	let	VERB
ajst-30556	52	2	*	*	VERB
ajst-30556	52	3	x	x	VERB
ajst-30556	52	4	be	be	AUX
ajst-30556	52	5	an	an	DET
ajst-30556	52	6	assignment	assignment	NOUN
ajst-30556	52	7	set	set	NOUN
ajst-30556	52	8	of	of	ADP
ajst-30556	52	9	the	the	DET
ajst-30556	52	10	c	c	NOUN
ajst-30556	52	11	-	-	PUNCT
ajst-30556	52	12	dcop	dcop	NOUN
ajst-30556	52	13	solution	solution	NOUN
ajst-30556	52	14	that	that	PRON
ajst-30556	52	15	minimizes	minimize	VERB
ajst-30556	52	16	the	the	DET
ajst-30556	52	17	sum	sum	NOUN
ajst-30556	52	18	of	of	ADP
ajst-30556	52	19	all	all	DET
ajst-30556	52	20	constraint	constraint	NOUN
ajst-30556	52	21	functions	function	NOUN
ajst-30556	52	22	,	,	PUNCT
ajst-30556	52	23	which	which	PRON
ajst-30556	52	24	can	can	AUX
ajst-30556	52	25	be	be	AUX
ajst-30556	52	26	expressed	express	VERB
ajst-30556	52	27	as	as	SCONJ
ajst-30556	52	28	follows	follow	VERB
ajst-30556	52	29	:	:	PUNCT
ajst-30556	52	30	*	*	PUNCT
ajst-30556	52	31	,	,	PUNCT
ajst-30556	52	32	arg	arg	NOUN
ajst-30556	52	33	min	min	NOUN
ajst-30556	52	34	(	(	PUNCT
ajst-30556	52	35	,	,	PUNCT
ajst-30556	52	36	)	)	PUNCT
ajst-30556	53	1	i	i	PRON
ajst-30556	53	2	i	i	PRON
ajst-30556	54	1	j	j	PROPN
ajst-30556	55	1	j	j	INTJ
ajst-30556	56	1	ij	ij	INTJ
ajst-30556	56	2	ij	ij	INTJ
ajst-30556	57	1	i	i	PRON
ajst-30556	58	1	i	i	PRON
ajst-30556	58	2	j	j	PROPN
ajst-30556	59	1	j	j	PROPN
ajst-30556	60	1	d	d	PROPN
ajst-30556	60	2	d	d	PROPN
ajst-30556	60	3	d	d	PROPN
ajst-30556	60	4	d	d	X
ajst-30556	60	5	f	f	X
ajst-30556	60	6	f	f	NOUN
ajst-30556	60	7	x	x	SYM
ajst-30556	60	8	f	f	NOUN
ajst-30556	60	9	x	x	SYM
ajst-30556	60	10	d	d	NOUN
ajst-30556	60	11	x	x	SYM
ajst-30556	60	12	d	d	X
ajst-30556	60	13	(	(	PUNCT
ajst-30556	60	14	1	1	NUM
ajst-30556	60	15	)	)	PUNCT
ajst-30556	60	16	2.2	2.2	NUM
ajst-30556	60	17	.	.	PUNCT
ajst-30556	61	1	an	an	DET
ajst-30556	61	2	example	example	NOUN
ajst-30556	61	3	of	of	ADP
ajst-30556	61	4	c	c	NOUN
ajst-30556	61	5	-	-	PUNCT
ajst-30556	61	6	dcop	dcop	NOUN
ajst-30556	61	7	.	.	PUNCT
ajst-30556	62	1	figure	figure	NOUN
ajst-30556	62	2	1	1	NUM
ajst-30556	62	3	below	below	ADP
ajst-30556	62	4	presents	present	VERB
ajst-30556	62	5	a	a	DET
ajst-30556	62	6	simple	simple	ADJ
ajst-30556	62	7	example	example	NOUN
ajst-30556	62	8	of	of	ADP
ajst-30556	62	9	a	a	DET
ajst-30556	62	10	c	c	NOUN
ajst-30556	62	11	-	-	PUNCT
ajst-30556	62	12	dcop	dcop	NOUN
ajst-30556	62	13	.	.	PUNCT
ajst-30556	63	1	in	in	ADP
ajst-30556	63	2	figure	figure	NOUN
ajst-30556	63	3	1(a	1(a	NUM
ajst-30556	63	4	)	)	PUNCT
ajst-30556	63	5	,	,	PUNCT
ajst-30556	63	6	a	a	DET
ajst-30556	63	7	constraint	constraint	NOUN
ajst-30556	63	8	graph	graph	NOUN
ajst-30556	63	9	containing	contain	VERB
ajst-30556	63	10	four	four	NUM
ajst-30556	63	11	variables	variable	NOUN
ajst-30556	63	12	is	be	AUX
ajst-30556	63	13	shown	show	VERB
ajst-30556	63	14	,	,	PUNCT
ajst-30556	63	15	where	where	SCONJ
ajst-30556	63	16	each	each	DET
ajst-30556	63	17	variable	variable	NOUN
ajst-30556	63	18	is	be	AUX
ajst-30556	63	19	controlled	control	VERB
ajst-30556	63	20	by	by	ADP
ajst-30556	63	21	an	an	DET
ajst-30556	63	22	agent	agent	NOUN
ajst-30556	63	23	.	.	PUNCT
ajst-30556	64	1	the	the	DET
ajst-30556	64	2	edges	edge	NOUN
ajst-30556	64	3	in	in	ADP
ajst-30556	64	4	the	the	DET
ajst-30556	64	5	graph	graph	NOUN
ajst-30556	64	6	represent	represent	VERB
ajst-30556	64	7	constraint	constraint	NOUN
ajst-30556	64	8	cost	cost	NOUN
ajst-30556	64	9	functions	function	NOUN
ajst-30556	64	10	,	,	PUNCT
ajst-30556	64	11	which	which	PRON
ajst-30556	64	12	are	be	AUX
ajst-30556	64	13	defined	define	VERB
ajst-30556	64	14	as	as	SCONJ
ajst-30556	64	15	shown	show	VERB
ajst-30556	64	16	in	in	ADP
ajst-30556	64	17	figure	figure	NOUN
ajst-30556	64	18	1(b	1(b	NUM
ajst-30556	64	19	)	)	PUNCT
ajst-30556	64	20	.	.	PUNCT
ajst-30556	65	1	notably	notably	ADV
ajst-30556	65	2	,	,	PUNCT
ajst-30556	65	3	the	the	DET
ajst-30556	65	4	domain	domain	NOUN
ajst-30556	65	5	of	of	ADP
ajst-30556	65	6	variable	variable	NOUN
ajst-30556	65	7	ix	ix	ADV
ajst-30556	65	8	is	be	AUX
ajst-30556	65	9	[	[	PUNCT
ajst-30556	65	10	10,10	10,10	NUM
ajst-30556	65	11	]	]	PUNCT
ajst-30556	65	12	.	.	PUNCT
ajst-30556	66	1	3	3	NUM
ajst-30556	66	2	4	4	NUM
ajst-30556	66	3	1	1	NUM
ajst-30556	66	4	4	4	NUM
ajst-30556	66	5	1	1	NUM
ajst-30556	66	6	2	2	NUM
ajst-30556	66	7	1	1	NUM
ajst-30556	66	8	2	2	NUM
ajst-30556	66	9	1	1	NUM
ajst-30556	66	10	2	2	NUM
ajst-30556	66	11	1	1	NUM
ajst-30556	66	12	2	2	NUM
ajst-30556	66	13	1	1	NUM
ajst-30556	66	14	3	3	NUM
ajst-30556	66	15	1	1	NUM
ajst-30556	66	16	3	3	NUM
ajst-30556	66	17	1	1	NUM
ajst-30556	66	18	3	3	NUM
ajst-30556	66	19	1	1	NUM
ajst-30556	66	20	3	3	NUM
ajst-30556	66	21	34	34	NUM
ajst-30556	66	22	1	1	NUM
ajst-30556	66	23	4	4	NUM
ajst-30556	66	24	4	4	NUM
ajst-30556	66	25	1	1	NUM
ajst-30556	66	26	5	5	NUM
ajst-30556	66	27	3	3	NUM
ajst-30556	66	28	3	3	NUM
ajst-30556	66	29	2	2	NUM
ajst-30556	66	30	2	2	NUM
ajst-30556	66	31	3	3	NUM
ajst-30556	66	32	4	4	NUM
ajst-30556	66	33	3	3	NUM
ajst-30556	66	34	4	4	NUM
ajst-30556	66	35	3	3	NUM
ajst-30556	66	36	4	4	NUM
ajst-30556	66	37	3	3	NUM
ajst-30556	66	38	:	:	PUNCT
ajst-30556	66	39	[	[	PUNCT
ajst-30556	66	40	10,10	10,10	NUM
ajst-30556	66	41	]	]	PUNCT
ajst-30556	66	42	(	(	PUNCT
ajst-30556	66	43	,	,	PUNCT
ajst-30556	66	44	)	)	PUNCT
ajst-30556	66	45	ln	ln	ADV
ajst-30556	67	1	|	|	ADV
ajst-30556	67	2	|	|	ADV
ajst-30556	67	3	(	(	PUNCT
ajst-30556	67	4	)	)	PUNCT
ajst-30556	67	5	(	(	PUNCT
ajst-30556	67	6	,	,	PUNCT
ajst-30556	67	7	)	)	PUNCT
ajst-30556	67	8	2	2	NUM
ajst-30556	67	9	2	2	NUM
ajst-30556	67	10	sin	sin	NOUN
ajst-30556	67	11	(	(	PUNCT
ajst-30556	67	12	)	)	PUNCT
ajst-30556	67	13	sin	sin	NOUN
ajst-30556	67	14	(	(	PUNCT
ajst-30556	67	15	)	)	PUNCT
ajst-30556	67	16	(	(	PUNCT
ajst-30556	67	17	,	,	PUNCT
ajst-30556	67	18	)	)	PUNCT
ajst-30556	67	19	6	6	NUM
ajst-30556	67	20	(	(	PUNCT
ajst-30556	67	21	,	,	PUNCT
ajst-30556	67	22	)	)	PUNCT
ajst-30556	67	23	7	7	NUM
ajst-30556	67	24	3	3	NUM
ajst-30556	67	25	4	4	NUM
ajst-30556	67	26	i	i	NOUN
ajst-30556	67	27	x	x	NOUN
ajst-30556	67	28	x	x	PUNCT
ajst-30556	67	29	x	x	PUNCT
ajst-30556	67	30	x	x	PUNCT
ajst-30556	68	1	d	d	NOUN
ajst-30556	68	2	f	f	X
ajst-30556	68	3	x	x	X
ajst-30556	68	4	x	x	PUNCT
ajst-30556	68	5	x	x	PUNCT
ajst-30556	68	6	x	x	PUNCT
ajst-30556	68	7	x	x	PUNCT
ajst-30556	68	8	x	x	PUNCT
ajst-30556	68	9	x	x	X
ajst-30556	68	10	f	f	NOUN
ajst-30556	68	11	x	x	PUNCT
ajst-30556	68	12	x	x	PUNCT
ajst-30556	68	13	x	x	PUNCT
ajst-30556	68	14	x	x	PUNCT
ajst-30556	68	15	x	x	PUNCT
ajst-30556	68	16	x	x	X
ajst-30556	68	17	f	f	NOUN
ajst-30556	68	18	x	x	PUNCT
ajst-30556	68	19	x	x	PUNCT
ajst-30556	68	20	x	x	PUNCT
ajst-30556	68	21	x	x	PUNCT
ajst-30556	68	22	e	e	NOUN
ajst-30556	68	23	f	f	X
ajst-30556	68	24	x	x	PUNCT
ajst-30556	68	25	x	x	PUNCT
ajst-30556	68	26	x	x	PUNCT
ajst-30556	68	27	x	x	PUNCT
ajst-30556	68	28	x	x	PUNCT
ajst-30556	68	29	x	x	SYM
ajst-30556	68	30	x	x	X
ajst-30556	68	31	a	a	DET
ajst-30556	68	32	constraint	constraint	NOUN
ajst-30556	68	33	graph	graph	NOUN
ajst-30556	68	34	b	b	PROPN
ajst-30556	68	35	constraint	constraint	NOUN
ajst-30556	68	36	function	function	NOUN
ajst-30556	68	37	figure	figure	NOUN
ajst-30556	68	38	1	1	NUM
ajst-30556	68	39	.	.	NOUN
ajst-30556	68	40	example	example	NOUN
ajst-30556	68	41	of	of	ADP
ajst-30556	68	42	c	c	NOUN
ajst-30556	68	43	-	-	PUNCT
ajst-30556	68	44	dcop	dcop	NOUN
ajst-30556	68	45	3	3	NUM
ajst-30556	68	46	.	.	PUNCT
ajst-30556	68	47	an	an	DET
ajst-30556	68	48	escape	escape	NOUN
ajst-30556	68	49	from	from	ADP
ajst-30556	68	50	local	local	ADJ
ajst-30556	68	51	optima	optima	PROPN
ajst-30556	68	52	algorithm	algorithm	NOUN
ajst-30556	68	53	based	base	VERB
ajst-30556	68	54	on	on	ADP
ajst-30556	68	55	historical	historical	ADJ
ajst-30556	68	56	feature	feature	NOUN
ajst-30556	68	57	distribution	distribution	NOUN
ajst-30556	68	58	3.1	3.1	NUM
ajst-30556	68	59	.	.	PUNCT
ajst-30556	69	1	motivation	motivation	NOUN
ajst-30556	69	2	hfda	hfda	PROPN
ajst-30556	69	3	divides	divide	VERB
ajst-30556	69	4	the	the	DET
ajst-30556	69	5	entire	entire	ADJ
ajst-30556	69	6	optimization	optimization	NOUN
ajst-30556	69	7	process	process	NOUN
ajst-30556	69	8	into	into	ADP
ajst-30556	69	9	several	several	ADJ
ajst-30556	69	10	ignored	ignore	VERB
ajst-30556	69	11	periods	period	NOUN
ajst-30556	69	12	,	,	PUNCT
ajst-30556	69	13	with	with	ADP
ajst-30556	69	14	the	the	DET
ajst-30556	69	15	division	division	NOUN
ajst-30556	69	16	based	base	VERB
ajst-30556	69	17	on	on	ADP
ajst-30556	69	18	the	the	DET
ajst-30556	69	19	start	start	NOUN
ajst-30556	69	20	and	and	CCONJ
ajst-30556	69	21	end	end	NOUN
ajst-30556	69	22	of	of	ADP
ajst-30556	69	23	local	local	ADJ
ajst-30556	69	24	optima	optima	NOUN
ajst-30556	69	25	.	.	PUNCT
ajst-30556	70	1	considering	consider	VERB
ajst-30556	70	2	that	that	SCONJ
ajst-30556	70	3	the	the	DET
ajst-30556	70	4	values	value	NOUN
ajst-30556	70	5	of	of	ADP
ajst-30556	70	6	neighbors	neighbor	NOUN
ajst-30556	70	7	and	and	CCONJ
ajst-30556	70	8	the	the	DET
ajst-30556	70	9	constraint	constraint	NOUN
ajst-30556	70	10	functions	function	NOUN
ajst-30556	70	11	play	play	VERB
ajst-30556	70	12	a	a	DET
ajst-30556	70	13	decisive	decisive	ADJ
ajst-30556	70	14	role	role	NOUN
ajst-30556	70	15	in	in	ADP
ajst-30556	70	16	the	the	DET
ajst-30556	70	17	current	current	ADJ
ajst-30556	70	18	solution	solution	NOUN
ajst-30556	70	19	space	space	NOUN
ajst-30556	70	20	of	of	ADP
ajst-30556	70	21	the	the	DET
ajst-30556	70	22	agent	agent	NOUN
ajst-30556	70	23	,	,	PUNCT
ajst-30556	70	24	it	it	PRON
ajst-30556	70	25	is	be	AUX
ajst-30556	70	26	decided	decide	VERB
ajst-30556	70	27	that	that	SCONJ
ajst-30556	70	28	when	when	SCONJ
ajst-30556	70	29	an	an	DET
ajst-30556	70	30	agent	agent	NOUN
ajst-30556	70	31	gets	get	VERB
ajst-30556	70	32	stuck	stick	VERB
ajst-30556	70	33	in	in	ADP
ajst-30556	70	34	a	a	DET
ajst-30556	70	35	local	local	ADJ
ajst-30556	70	36	optimum	optimum	NOUN
ajst-30556	70	37	,	,	PUNCT
ajst-30556	70	38	an	an	DET
ajst-30556	70	39	integral	integral	ADJ
ajst-30556	70	40	form	form	NOUN
ajst-30556	70	41	is	be	AUX
ajst-30556	70	42	used	use	VERB
ajst-30556	70	43	to	to	PART
ajst-30556	70	44	represent	represent	VERB
ajst-30556	70	45	the	the	DET
ajst-30556	70	46	magnitude	magnitude	NOUN
ajst-30556	70	47	of	of	ADP
ajst-30556	70	48	influence	influence	NOUN
ajst-30556	70	49	based	base	VERB
ajst-30556	70	50	on	on	ADP
ajst-30556	70	51	the	the	DET
ajst-30556	70	52	neighbors	neighbor	NOUN
ajst-30556	70	53	'	'	PART
ajst-30556	70	54	values	value	NOUN
ajst-30556	70	55	and	and	CCONJ
ajst-30556	70	56	the	the	DET
ajst-30556	70	57	constraint	constraint	NOUN
ajst-30556	70	58	functions	function	NOUN
ajst-30556	70	59	.	.	PUNCT
ajst-30556	71	1	the	the	DET
ajst-30556	71	2	agent	agent	NOUN
ajst-30556	71	3	can	can	AUX
ajst-30556	71	4	ignore	ignore	VERB
ajst-30556	71	5	the	the	DET
ajst-30556	71	6	values	value	NOUN
ajst-30556	71	7	of	of	ADP
ajst-30556	71	8	poorer	poor	ADJ
ajst-30556	71	9	neighbors	neighbor	NOUN
ajst-30556	71	10	according	accord	VERB
ajst-30556	71	11	to	to	ADP
ajst-30556	71	12	a	a	DET
ajst-30556	71	13	specific	specific	ADJ
ajst-30556	71	14	ignoring	ignore	VERB
ajst-30556	71	15	strategy	strategy	NOUN
ajst-30556	71	16	,	,	PUNCT
ajst-30556	71	17	and	and	CCONJ
ajst-30556	71	18	further	far	ADV
ajst-30556	71	19	explore	explore	VERB
ajst-30556	71	20	a	a	DET
ajst-30556	71	21	new	new	ADJ
ajst-30556	71	22	solution	solution	NOUN
ajst-30556	71	23	space	space	NOUN
ajst-30556	71	24	.	.	PUNCT
ajst-30556	72	1	based	base	VERB
ajst-30556	72	2	on	on	ADP
ajst-30556	72	3	this	this	DET
ajst-30556	72	4	idea	idea	NOUN
ajst-30556	72	5	,	,	PUNCT
ajst-30556	72	6	the	the	DET
ajst-30556	72	7	detailed	detailed	ADJ
ajst-30556	72	8	content	content	NOUN
ajst-30556	72	9	of	of	ADP
ajst-30556	72	10	the	the	DET
ajst-30556	72	11	algorithm	algorithm	NOUN
ajst-30556	72	12	are	be	AUX
ajst-30556	72	13	introduced	introduce	VERB
ajst-30556	72	14	as	as	ADP
ajst-30556	72	15	the	the	DET
ajst-30556	72	16	following	follow	VERB
ajst-30556	72	17	section	section	NOUN
ajst-30556	72	18	.	.	PUNCT
ajst-30556	73	1	3.2	3.2	NUM
ajst-30556	73	2	.	.	PUNCT
ajst-30556	73	3	steps	step	NOUN
ajst-30556	73	4	of	of	ADP
ajst-30556	73	5	the	the	DET
ajst-30556	73	6	hfda	hfda	ADJ
ajst-30556	73	7	algorithm	algorithm	NOUN
ajst-30556	73	8	alogorithm	alogorithm	NOUN
ajst-30556	73	9	hfda	hfda	ADJ
ajst-30556	73	10	1	1	NUM
ajst-30556	73	11	.	.	PUNCT
ajst-30556	73	12	initialization	initialization	NOUN
ajst-30556	73	13	parameters	parameter	NOUN
ajst-30556	73	14	,	,	PUNCT
ajst-30556	73	15	,	,	PUNCT
ajst-30556	73	16	cos	cos	PROPN
ajst-30556	73	17	,	,	PUNCT
ajst-30556	73	18	,	,	PUNCT
ajst-30556	73	19	,	,	PUNCT
ajst-30556	73	20	n	n	PRON
ajst-30556	73	21	start	start	VERB
ajst-30556	74	1	global	global	PROPN
ajst-30556	74	2	t	t	PROPN
ajst-30556	75	1	k	k	PROPN
ajst-30556	75	2	p	p	X
ajst-30556	75	3	zthreshold	zthreshold	PROPN
ajst-30556	75	4	i	i	NOUN
ajst-30556	75	5	:	:	PUNCT
ajst-30556	75	6	2	2	X
ajst-30556	75	7	.	.	X
ajst-30556	75	8	initialization	initialization	NOUN
ajst-30556	75	9	agents	agent	NOUN
ajst-30556	75	10	3	3	NUM
ajst-30556	75	11	.	.	PUNCT
ajst-30556	76	1	before	before	ADP
ajst-30556	76	2	reaching	reach	VERB
ajst-30556	76	3	the	the	DET
ajst-30556	76	4	termination	termination	NOUN
ajst-30556	76	5	(	(	PUNCT
ajst-30556	76	6	iteration	iteration	NOUN
ajst-30556	76	7	maxiteration	maxiteration	NOUN
ajst-30556	76	8	):	):	PUNCT
ajst-30556	76	9	3	3	X
ajst-30556	76	10	.	.	X
ajst-30556	76	11	for	for	SCONJ
ajst-30556	76	12	1a	1a	NUM
ajst-30556	76	13	to	to	PART
ajst-30556	76	14	na	na	PART
ajst-30556	76	15	do	do	VERB
ajst-30556	76	16	4	4	NUM
ajst-30556	76	17	.	.	PUNCT
ajst-30556	77	1	agent	agent	NOUN
ajst-30556	77	2	calculates	calculate	VERB
ajst-30556	77	3	localcost	localcost	PROPN
ajst-30556	77	4	:	:	PUNCT
ajst-30556	78	1	5	5	X
ajst-30556	78	2	.	.	X
ajst-30556	79	1	if	if	SCONJ
ajst-30556	79	2	neighbor	neighbor	NOUN
ajst-30556	79	3	's	's	PART
ajst-30556	79	4	state	state	NOUN
ajst-30556	79	5	is	be	AUX
ajst-30556	79	6	in	in	ADP
ajst-30556	79	7	the	the	DET
ajst-30556	79	8	ignore	ignore	ADJ
ajst-30556	79	9	state	state	NOUN
ajst-30556	79	10	then	then	ADV
ajst-30556	79	11	6	6	NUM
ajst-30556	79	12	.	.	X
ajst-30556	79	13	reject	reject	VERB
ajst-30556	79	14	its	its	PRON
ajst-30556	79	15	value	value	NOUN
ajst-30556	79	16	message	message	NOUN
ajst-30556	79	17	7	7	NUM
ajst-30556	79	18	.	.	NOUN
ajst-30556	79	19	calculate	calculate	VERB
ajst-30556	79	20	local	local	ADJ
ajst-30556	79	21	cost	cost	NOUN
ajst-30556	79	22	8	8	NUM
ajst-30556	79	23	.	.	PUNCT
ajst-30556	80	1	send	send	VERB
ajst-30556	80	2	value	value	NOUN
ajst-30556	80	3	message	message	NOUN
ajst-30556	80	4	to	to	ADP
ajst-30556	80	5	every	every	DET
ajst-30556	80	6	neighbors	neighbor	NOUN
ajst-30556	80	7	jn	jn	PROPN
ajst-30556	80	8	n	n	PROPN
ajst-30556	80	9	9	9	NUM
ajst-30556	80	10	.	.	PUNCT
ajst-30556	81	1	update	update	VERB
ajst-30556	81	2	every	every	DET
ajst-30556	81	3	neighbors	neighbor	NOUN
ajst-30556	81	4	jn	jn	PROPN
ajst-30556	81	5	to	to	AUX
ajst-30556	81	6	non	non	ADJ
ajst-30556	81	7	-	-	ADJ
ajst-30556	81	8	ignore	ignore	VERB
ajst-30556	81	9	state	state	NOUN
ajst-30556	81	10	10	10	NUM
ajst-30556	81	11	.	.	PUNCT
ajst-30556	82	1	if	if	SCONJ
ajst-30556	82	2	neighbors	neighbor	NOUN
ajst-30556	82	3	being	be	AUX
ajst-30556	82	4	ignored	ignore	VERB
ajst-30556	82	5	in	in	ADP
ajst-30556	82	6	current	current	ADJ
ajst-30556	82	7	optimization	optimization	NOUN
ajst-30556	82	8	and	and	CCONJ
ajst-30556	82	9	in	in	ADP
ajst-30556	82	10	a	a	DET
ajst-30556	82	11	non	non	ADJ
ajst-30556	82	12	-	-	ADJ
ajst-30556	82	13	convergent	convergent	ADJ
ajst-30556	82	14	phase	phase	NOUN
ajst-30556	82	15	then	then	ADV
ajst-30556	82	16	11	11	NUM
ajst-30556	82	17	.	.	PUNCT
ajst-30556	83	1	agents	agent	NOUN
ajst-30556	83	2	give	give	VERB
ajst-30556	83	3	up	up	ADP
ajst-30556	83	4	anytime	anytime	NOUN
ajst-30556	83	5	property	property	NOUN
ajst-30556	83	6	,	,	PUNCT
ajst-30556	83	7	adopt	adopt	VERB
ajst-30556	83	8	the	the	DET
ajst-30556	83	9	current	current	ADJ
ajst-30556	83	10	solution	solution	NOUN
ajst-30556	83	11	space	space	NOUN
ajst-30556	83	12	12	12	NUM
ajst-30556	83	13	.	.	PUNCT
ajst-30556	84	1	update	update	NOUN
ajst-30556	84	2	cosglobal	cosglobal	PROPN
ajst-30556	84	3	t	t	PROPN
ajst-30556	84	4	,	,	PUNCT
ajst-30556	84	5	cache	cache	VERB
ajst-30556	84	6	the	the	DET
ajst-30556	84	7	current	current	ADJ
ajst-30556	84	8	value	value	NOUN
ajst-30556	84	9	of	of	ADP
ajst-30556	84	10	the	the	DET
ajst-30556	84	11	agent	agent	NOUN
ajst-30556	84	12	ix	ix	ADP
ajst-30556	84	13	13	13	NUM
ajst-30556	84	14	.	.	PUNCT
ajst-30556	85	1	if	if	SCONJ
ajst-30556	85	2	being	be	AUX
ajst-30556	85	3	local	local	ADJ
ajst-30556	85	4	optimum	optimum	ADJ
ajst-30556	85	5	or	or	CCONJ
ajst-30556	85	6	non	non	ADJ
ajst-30556	85	7	-	-	ADJ
ajst-30556	85	8	free	free	ADJ
ajst-30556	85	9	optimization	optimization	NOUN
ajst-30556	85	10	phase	phase	NOUN
ajst-30556	85	11	iteration	iteration	NOUN
ajst-30556	85	12	k	k	PROPN
ajst-30556	85	13	then	then	ADV
ajst-30556	85	14	245	245	NUM
ajst-30556	85	15	14	14	NUM
ajst-30556	85	16	.	.	PUNCT
ajst-30556	86	1	for	for	ADP
ajst-30556	86	2	t	t	PROPN
ajst-30556	86	3	from	from	ADP
ajst-30556	86	4	start	start	NOUN
ajst-30556	86	5	to	to	ADP
ajst-30556	86	6	iteration	iteration	NOUN
ajst-30556	86	7	do	do	VERB
ajst-30556	86	8	15	15	NUM
ajst-30556	86	9	.	.	PUNCT
ajst-30556	87	1	calculate	calculate	VERB
ajst-30556	87	2	the	the	DET
ajst-30556	87	3	instantaneous	instantaneous	ADJ
ajst-30556	87	4	integral	integral	ADJ
ajst-30556	87	5	influence	influence	NOUN
ajst-30556	87	6	value	value	NOUN
ajst-30556	87	7	(	(	PUNCT
ajst-30556	87	8	|	|	ADV
ajst-30556	87	9	)	)	PUNCT
ajst-30556	87	10	ti	ti	PROPN
ajst-30556	87	11	ji	ji	NOUN
ajst-30556	87	12	x	x	PROPN
ajst-30556	87	13	x	x	NOUN
ajst-30556	87	14	and	and	CCONJ
ajst-30556	87	15	phase	phase	NOUN
ajst-30556	87	16	variation	variation	NOUN
ajst-30556	87	17	coefficient	coefficient	NOUN
ajst-30556	87	18	of	of	ADP
ajst-30556	87	19	neighbor	neighbor	NOUN
ajst-30556	87	20	jn	jn	PROPN
ajst-30556	87	21	.	.	PUNCT
ajst-30556	88	1	16	16	NUM
ajst-30556	88	2	.	.	PUNCT
ajst-30556	89	1	normalize	normalize	VERB
ajst-30556	89	2	ks	ks	NOUN
ajst-30556	89	3	to	to	ADP
ajst-30556	89	4	the	the	DET
ajst-30556	89	5	final	final	ADJ
ajst-30556	89	6	influence	influence	NOUN
ajst-30556	89	7	value	value	NOUN
ajst-30556	89	8	j	j	PROPN
ajst-30556	89	9	ie	ie	ADV
ajst-30556	89	10	using	use	VERB
ajst-30556	89	11	the	the	DET
ajst-30556	89	12	softmax	softmax	NOUN
ajst-30556	89	13	function	function	NOUN
ajst-30556	89	14	.	.	PUNCT
ajst-30556	90	1	17	17	NUM
ajst-30556	90	2	.	.	PUNCT
ajst-30556	90	3	mark	mark	VERB
ajst-30556	90	4	the	the	DET
ajst-30556	90	5	state	state	NOUN
ajst-30556	90	6	of	of	ADP
ajst-30556	90	7	neighbors	neighbor	NOUN
ajst-30556	90	8	with	with	ADP
ajst-30556	90	9	stronger	strong	ADJ
ajst-30556	90	10	influence	influence	NOUN
ajst-30556	90	11	as	as	ADP
ajst-30556	90	12	the	the	DET
ajst-30556	90	13	ignore	ignore	NOUN
ajst-30556	90	14	state	state	NOUN
ajst-30556	90	15	based	base	VERB
ajst-30556	90	16	on	on	ADP
ajst-30556	90	17	the	the	DET
ajst-30556	90	18	cumulative	cumulative	ADJ
ajst-30556	90	19	probability	probability	NOUN
ajst-30556	90	20	method	method	NOUN
ajst-30556	90	21	.	.	PUNCT
ajst-30556	91	1	18	18	NUM
ajst-30556	91	2	.	.	PUNCT
ajst-30556	92	1	start	start	VERB
ajst-30556	92	2	iteration	iteration	NOUN
ajst-30556	92	3	19	19	NUM
ajst-30556	92	4	.	.	PUNCT
ajst-30556	92	5	iteration	iteration	PROPN
ajst-30556	92	6	20	20	NUM
ajst-30556	92	7	.	.	PUNCT
ajst-30556	93	1	iteration	iteration	NOUN
ajst-30556	94	1	+	+	PROPN
ajst-30556	94	2	+	+	NOUN
ajst-30556	94	3	due	due	ADP
ajst-30556	94	4	to	to	ADP
ajst-30556	94	5	the	the	DET
ajst-30556	94	6	explosion	explosion	NOUN
ajst-30556	94	7	algorithm	algorithm	NOUN
ajst-30556	94	8	generating	generate	VERB
ajst-30556	94	9	multiple	multiple	ADJ
ajst-30556	94	10	individuals	individual	NOUN
ajst-30556	94	11	based	base	VERB
ajst-30556	94	12	on	on	ADP
ajst-30556	94	13	a	a	DET
ajst-30556	94	14	single	single	ADJ
ajst-30556	94	15	agent	agent	NOUN
ajst-30556	94	16	,	,	PUNCT
ajst-30556	94	17	it	it	PRON
ajst-30556	94	18	may	may	AUX
ajst-30556	94	19	cause	cause	VERB
ajst-30556	94	20	significant	significant	ADJ
ajst-30556	94	21	space	space	NOUN
ajst-30556	94	22	overhead	overhead	ADV
ajst-30556	94	23	in	in	ADP
ajst-30556	94	24	the	the	DET
ajst-30556	94	25	context	context	NOUN
ajst-30556	94	26	of	of	ADP
ajst-30556	94	27	continuous	continuous	ADJ
ajst-30556	94	28	distributed	distribute	VERB
ajst-30556	94	29	constraint	constraint	NOUN
ajst-30556	94	30	optimization	optimization	NOUN
ajst-30556	94	31	problems	problem	NOUN
ajst-30556	94	32	.	.	PUNCT
ajst-30556	95	1	therefore	therefore	ADV
ajst-30556	95	2	,	,	PUNCT
ajst-30556	95	3	during	during	ADP
ajst-30556	95	4	the	the	DET
ajst-30556	95	5	value	value	NOUN
ajst-30556	95	6	optimization	optimization	NOUN
ajst-30556	95	7	phase	phase	NOUN
ajst-30556	95	8	,	,	PUNCT
ajst-30556	95	9	hfda	hfda	ADJ
ajst-30556	95	10	only	only	ADV
ajst-30556	95	11	uses	use	VERB
ajst-30556	95	12	a	a	DET
ajst-30556	95	13	simple	simple	ADJ
ajst-30556	95	14	random	random	ADJ
ajst-30556	95	15	value	value	NOUN
ajst-30556	95	16	generation	generation	NOUN
ajst-30556	95	17	strategy	strategy	NOUN
ajst-30556	95	18	to	to	PART
ajst-30556	95	19	construct	construct	VERB
ajst-30556	95	20	new	new	ADJ
ajst-30556	95	21	values	value	NOUN
ajst-30556	95	22	.	.	PUNCT
ajst-30556	96	1	to	to	PART
ajst-30556	96	2	more	more	ADV
ajst-30556	96	3	prominently	prominently	ADV
ajst-30556	96	4	display	display	VERB
ajst-30556	96	5	the	the	DET
ajst-30556	96	6	effect	effect	NOUN
ajst-30556	96	7	of	of	ADP
ajst-30556	96	8	the	the	DET
ajst-30556	96	9	influence	influence	NOUN
ajst-30556	96	10	strategy	strategy	NOUN
ajst-30556	96	11	,	,	PUNCT
ajst-30556	96	12	the	the	DET
ajst-30556	96	13	algorithm	algorithm	NOUN
ajst-30556	96	14	increases	increase	VERB
ajst-30556	96	15	the	the	DET
ajst-30556	96	16	number	number	NOUN
ajst-30556	96	17	of	of	ADP
ajst-30556	96	18	sampling	sample	VERB
ajst-30556	96	19	points	point	NOUN
ajst-30556	96	20	in	in	ADP
ajst-30556	96	21	the	the	DET
ajst-30556	96	22	value	value	NOUN
ajst-30556	96	23	domain	domain	NOUN
ajst-30556	96	24	space	space	NOUN
ajst-30556	96	25	during	during	ADP
ajst-30556	96	26	each	each	DET
ajst-30556	96	27	value	value	NOUN
ajst-30556	96	28	generation	generation	NOUN
ajst-30556	96	29	.	.	PUNCT
ajst-30556	97	1	it	it	PRON
ajst-30556	97	2	is	be	AUX
ajst-30556	97	3	worth	worth	ADJ
ajst-30556	97	4	noting	note	VERB
ajst-30556	97	5	that	that	SCONJ
ajst-30556	97	6	increasing	increase	VERB
ajst-30556	97	7	the	the	DET
ajst-30556	97	8	number	number	NOUN
ajst-30556	97	9	of	of	ADP
ajst-30556	97	10	sampling	sample	VERB
ajst-30556	97	11	points	point	NOUN
ajst-30556	97	12	does	do	AUX
ajst-30556	97	13	not	not	PART
ajst-30556	97	14	affect	affect	VERB
ajst-30556	97	15	the	the	DET
ajst-30556	97	16	final	final	ADJ
ajst-30556	97	17	solution	solution	NOUN
ajst-30556	97	18	quality	quality	NOUN
ajst-30556	97	19	of	of	ADP
ajst-30556	97	20	the	the	DET
ajst-30556	97	21	algorithm	algorithm	NOUN
ajst-30556	97	22	but	but	CCONJ
ajst-30556	97	23	only	only	ADV
ajst-30556	97	24	accelerates	accelerate	VERB
ajst-30556	97	25	the	the	DET
ajst-30556	97	26	speed	speed	NOUN
ajst-30556	97	27	at	at	ADP
ajst-30556	97	28	which	which	PRON
ajst-30556	97	29	the	the	DET
ajst-30556	97	30	algorithm	algorithm	NOUN
ajst-30556	97	31	enters	enter	VERB
ajst-30556	97	32	a	a	DET
ajst-30556	97	33	local	local	ADJ
ajst-30556	97	34	optimum	optimum	NOUN
ajst-30556	97	35	.	.	PUNCT
ajst-30556	98	1	in	in	ADP
ajst-30556	98	2	step	step	NOUN
ajst-30556	98	3	10	10	NUM
ajst-30556	98	4	,	,	PUNCT
ajst-30556	98	5	the	the	DET
ajst-30556	98	6	algorithm	algorithm	NOUN
ajst-30556	98	7	calculates	calculate	VERB
ajst-30556	98	8	the	the	DET
ajst-30556	98	9	difference	difference	NOUN
ajst-30556	98	10	between	between	ADP
ajst-30556	98	11	the	the	DET
ajst-30556	98	12	global	global	ADJ
ajst-30556	98	13	cost	cost	NOUN
ajst-30556	98	14	average	average	NOUN
ajst-30556	98	15	of	of	ADP
ajst-30556	98	16	the	the	DET
ajst-30556	98	17	most	most	ADV
ajst-30556	98	18	recent	recent	ADJ
ajst-30556	98	19	iterations	iteration	NOUN
ajst-30556	98	20	and	and	CCONJ
ajst-30556	98	21	the	the	DET
ajst-30556	98	22	most	most	ADV
ajst-30556	98	23	recent	recent	ADJ
ajst-30556	98	24	value	value	NOUN
ajst-30556	98	25	.	.	PUNCT
ajst-30556	99	1	if	if	SCONJ
ajst-30556	99	2	the	the	DET
ajst-30556	99	3	absolute	absolute	ADJ
ajst-30556	99	4	value	value	NOUN
ajst-30556	99	5	of	of	ADP
ajst-30556	99	6	this	this	DET
ajst-30556	99	7	difference	difference	NOUN
ajst-30556	99	8	is	be	AUX
ajst-30556	99	9	smaller	small	ADJ
ajst-30556	99	10	than	than	ADP
ajst-30556	99	11	a	a	DET
ajst-30556	99	12	sufficiently	sufficiently	ADV
ajst-30556	99	13	small	small	ADJ
ajst-30556	99	14	given	give	VERB
ajst-30556	99	15	number	number	NOUN
ajst-30556	99	16	epsilon	epsilon	PROPN
ajst-30556	99	17	,	,	PUNCT
ajst-30556	99	18	it	it	PRON
ajst-30556	99	19	indicates	indicate	VERB
ajst-30556	99	20	that	that	SCONJ
ajst-30556	99	21	the	the	DET
ajst-30556	99	22	algorithm	algorithm	NOUN
ajst-30556	99	23	has	have	AUX
ajst-30556	99	24	entered	enter	VERB
ajst-30556	99	25	a	a	DET
ajst-30556	99	26	local	local	ADJ
ajst-30556	99	27	optimum	optimum	ADJ
ajst-30556	99	28	or	or	CCONJ
ajst-30556	99	29	stagnation	stagnation	NOUN
ajst-30556	99	30	state	state	NOUN
ajst-30556	99	31	.	.	PUNCT
ajst-30556	100	1	the	the	DET
ajst-30556	100	2	agent	agent	NOUN
ajst-30556	100	3	constructs	construct	VERB
ajst-30556	100	4	the	the	DET
ajst-30556	100	5	integral	integral	ADJ
ajst-30556	100	6	influence	influence	NOUN
ajst-30556	100	7	(	(	PUNCT
ajst-30556	100	8	|	|	ADV
ajst-30556	100	9	)	)	PUNCT
ajst-30556	100	10	ti	ti	PROPN
ajst-30556	101	1	ji	ji	NOUN
ajst-30556	101	2	x	x	PROPN
ajst-30556	101	3	x	x	PROPN
ajst-30556	101	4	of	of	ADP
ajst-30556	101	5	each	each	DET
ajst-30556	101	6	iteration	iteration	NOUN
ajst-30556	101	7	based	base	VERB
ajst-30556	101	8	on	on	ADP
ajst-30556	101	9	historical	historical	ADJ
ajst-30556	101	10	values	value	NOUN
ajst-30556	101	11	and	and	CCONJ
ajst-30556	101	12	the	the	DET
ajst-30556	101	13	constraint	constraint	NOUN
ajst-30556	101	14	function	function	NOUN
ajst-30556	101	15	(	(	PUNCT
ajst-30556	101	16	requiring	require	VERB
ajst-30556	101	17	that	that	SCONJ
ajst-30556	101	18	the	the	DET
ajst-30556	101	19	constraint	constraint	NOUN
ajst-30556	101	20	function	function	NOUN
ajst-30556	101	21	is	be	AUX
ajst-30556	101	22	bounded	bound	VERB
ajst-30556	101	23	,	,	PUNCT
ajst-30556	101	24	continuous	continuous	ADJ
ajst-30556	101	25	,	,	PUNCT
ajst-30556	101	26	and	and	CCONJ
ajst-30556	101	27	contains	contain	VERB
ajst-30556	101	28	only	only	ADV
ajst-30556	101	29	a	a	DET
ajst-30556	101	30	finite	finite	ADJ
ajst-30556	101	31	number	number	NOUN
ajst-30556	101	32	of	of	ADP
ajst-30556	101	33	first	first	ADJ
ajst-30556	101	34	-	-	PUNCT
ajst-30556	101	35	class	class	NOUN
ajst-30556	101	36	discontinuities	discontinuity	NOUN
ajst-30556	101	37	within	within	ADP
ajst-30556	101	38	its	its	PRON
ajst-30556	101	39	value	value	NOUN
ajst-30556	101	40	domain	domain	NOUN
ajst-30556	101	41	)	)	PUNCT
ajst-30556	101	42	.	.	PUNCT
ajst-30556	102	1	the	the	DET
ajst-30556	102	2	specific	specific	ADJ
ajst-30556	102	3	construction	construction	NOUN
ajst-30556	102	4	method	method	NOUN
ajst-30556	102	5	is	be	AUX
ajst-30556	102	6	shown	show	VERB
ajst-30556	102	7	as	as	SCONJ
ajst-30556	102	8	follows	follow	VERB
ajst-30556	102	9	:	:	PUNCT
ajst-30556	102	10	(	(	PUNCT
ajst-30556	102	11	|	|	ADV
ajst-30556	102	12	)	)	PUNCT
ajst-30556	102	13	(	(	PUNCT
ajst-30556	102	14	,	,	PUNCT
ajst-30556	102	15	)	)	PUNCT
ajst-30556	103	1	(	(	PUNCT
ajst-30556	103	2	)	)	PUNCT
ajst-30556	103	3	ub	ub	ADP
ajst-30556	103	4	t	t	PROPN
ajst-30556	103	5	t	t	PROPN
ajst-30556	104	1	i	i	PRON
ajst-30556	104	2	j	j	PROPN
ajst-30556	105	1	i	i	PRON
ajst-30556	105	2	j	j	PROPN
ajst-30556	106	1	j	j	NOUN
ajst-30556	106	2	lb	lb	INTJ
ajst-30556	106	3	i	i	NOUN
ajst-30556	106	4	x	x	PROPN
ajst-30556	107	1	x	x	X
ajst-30556	107	2	f	f	NOUN
ajst-30556	107	3	x	x	PUNCT
ajst-30556	107	4	x	x	SYM
ajst-30556	107	5	d	d	NOUN
ajst-30556	107	6	x	x	X
ajst-30556	107	7	(	(	PUNCT
ajst-30556	107	8	2	2	NUM
ajst-30556	107	9	)	)	PUNCT
ajst-30556	107	10	where	where	SCONJ
ajst-30556	107	11	t	t	PROPN
ajst-30556	107	12	represents	represent	VERB
ajst-30556	107	13	any	any	DET
ajst-30556	107	14	iteration	iteration	NOUN
ajst-30556	107	15	from	from	ADP
ajst-30556	107	16	start	start	NOUN
ajst-30556	107	17	to	to	ADP
ajst-30556	107	18	iteration	iteration	NOUN
ajst-30556	107	19	,	,	PUNCT
ajst-30556	107	20	and	and	CCONJ
ajst-30556	107	21	this	this	DET
ajst-30556	107	22	value	value	NOUN
ajst-30556	107	23	reflects	reflect	VERB
ajst-30556	107	24	the	the	DET
ajst-30556	107	25	distribution	distribution	NOUN
ajst-30556	107	26	of	of	ADP
ajst-30556	107	27	the	the	DET
ajst-30556	107	28	neighbors	neighbor	NOUN
ajst-30556	107	29	'	'	PART
ajst-30556	107	30	control	control	NOUN
ajst-30556	107	31	ability	ability	NOUN
ajst-30556	107	32	combined	combine	VERB
ajst-30556	107	33	with	with	ADP
ajst-30556	107	34	the	the	DET
ajst-30556	107	35	continuous	continuous	ADJ
ajst-30556	107	36	constraint	constraint	NOUN
ajst-30556	107	37	function	function	NOUN
ajst-30556	107	38	in	in	ADP
ajst-30556	107	39	each	each	DET
ajst-30556	107	40	iteration	iteration	NOUN
ajst-30556	107	41	,	,	PUNCT
ajst-30556	107	42	after	after	ADP
ajst-30556	107	43	deriving	derive	VERB
ajst-30556	107	44	the	the	DET
ajst-30556	107	45	stage	stage	NOUN
ajst-30556	107	46	influence	influence	NOUN
ajst-30556	107	47	of	of	ADP
ajst-30556	107	48	all	all	DET
ajst-30556	107	49	neighbors	neighbor	NOUN
ajst-30556	107	50	in	in	ADP
ajst-30556	107	51	that	that	DET
ajst-30556	107	52	phase	phase	NOUN
ajst-30556	107	53	,	,	PUNCT
ajst-30556	107	54	the	the	DET
ajst-30556	107	55	stage	stage	NOUN
ajst-30556	107	56	influence	influence	NOUN
ajst-30556	107	57	variation	variation	NOUN
ajst-30556	107	58	coefficient	coefficient	NOUN
ajst-30556	107	59	ks	ks	NOUN
ajst-30556	107	60	vc	vc	PROPN
ajst-30556	107	61	is	be	AUX
ajst-30556	107	62	then	then	ADV
ajst-30556	107	63	calculated	calculate	VERB
ajst-30556	107	64	,	,	PUNCT
ajst-30556	107	65	as	as	SCONJ
ajst-30556	107	66	shown	show	VERB
ajst-30556	107	67	in	in	ADP
ajst-30556	107	68	the	the	DET
ajst-30556	107	69	following	follow	VERB
ajst-30556	107	70	formula	formula	NOUN
ajst-30556	107	71	:	:	PUNCT
ajst-30556	108	1	(	(	PUNCT
ajst-30556	108	2	|	|	ADV
ajst-30556	108	3	)	)	PUNCT
ajst-30556	108	4	kk	kk	PROPN
ajst-30556	109	1	k	k	PROPN
ajst-30556	110	1	k	k	PROPN
ajst-30556	111	1	ss	ss	PROPN
ajst-30556	112	1	s	s	VERB
ajst-30556	113	1	i	i	PRON
ajst-30556	113	2	j	j	PROPN
ajst-30556	114	1	i	i	PRON
ajst-30556	114	2	v	v	VERB
ajst-30556	114	3	s	s	VERB
ajst-30556	114	4	i	i	NOUN
ajst-30556	114	5	x	x	PUNCT
ajst-30556	115	1	x	x	SYM
ajst-30556	115	2	c	c	NOUN
ajst-30556	115	3	u	u	NOUN
ajst-30556	115	4	(	(	PUNCT
ajst-30556	115	5	3	3	NUM
ajst-30556	115	6	)	)	PUNCT
ajst-30556	115	7	where	where	SCONJ
ajst-30556	115	8	ks	ks	PROPN
ajst-30556	115	9	represents	represent	VERB
ajst-30556	115	10	the	the	DET
ajst-30556	115	11	local	local	ADJ
ajst-30556	115	12	optimal	optimal	ADJ
ajst-30556	115	13	stage	stage	NOUN
ajst-30556	115	14	of	of	ADP
ajst-30556	115	15	the	the	DET
ajst-30556	115	16	k	k	PROPN
ajst-30556	115	17	th	th	X
ajst-30556	115	18	iteration	iteration	NOUN
ajst-30556	115	19	in	in	ADP
ajst-30556	115	20	the	the	DET
ajst-30556	115	21	global	global	ADJ
ajst-30556	115	22	iteration	iteration	NOUN
ajst-30556	115	23	process	process	NOUN
ajst-30556	115	24	;	;	PUNCT
ajst-30556	115	25	ks	ks	PROPN
ajst-30556	115	26	is	be	AUX
ajst-30556	115	27	the	the	DET
ajst-30556	115	28	variance	variance	NOUN
ajst-30556	115	29	of	of	ADP
ajst-30556	115	30	the	the	DET
ajst-30556	115	31	neighbor	neighbor	NOUN
ajst-30556	115	32	influence	influence	NOUN
ajst-30556	115	33	at	at	ADP
ajst-30556	115	34	this	this	DET
ajst-30556	115	35	stage	stage	NOUN
ajst-30556	115	36	,	,	PUNCT
ajst-30556	115	37	and	and	CCONJ
ajst-30556	115	38	ks	ks	PROPN
ajst-30556	115	39	is	be	AUX
ajst-30556	115	40	the	the	DET
ajst-30556	115	41	standard	standard	ADJ
ajst-30556	115	42	deviation	deviation	NOUN
ajst-30556	115	43	.	.	PUNCT
ajst-30556	116	1	this	this	DET
ajst-30556	116	2	variation	variation	NOUN
ajst-30556	116	3	coefficient	coefficient	NOUN
ajst-30556	116	4	can	can	AUX
ajst-30556	116	5	measure	measure	VERB
ajst-30556	116	6	the	the	DET
ajst-30556	116	7	influence	influence	NOUN
ajst-30556	116	8	of	of	ADP
ajst-30556	116	9	neighbors	neighbor	NOUN
ajst-30556	116	10	based	base	VERB
ajst-30556	116	11	on	on	ADP
ajst-30556	116	12	their	their	PRON
ajst-30556	116	13	control	control	NOUN
ajst-30556	116	14	over	over	ADP
ajst-30556	116	15	the	the	DET
ajst-30556	116	16	agent	agent	NOUN
ajst-30556	116	17	's	's	PART
ajst-30556	116	18	local	local	ADJ
ajst-30556	116	19	values	value	NOUN
ajst-30556	116	20	.	.	PUNCT
ajst-30556	117	1	since	since	SCONJ
ajst-30556	117	2	the	the	DET
ajst-30556	117	3	final	final	ADJ
ajst-30556	117	4	form	form	NOUN
ajst-30556	117	5	of	of	ADP
ajst-30556	117	6	ignoring	ignore	VERB
ajst-30556	117	7	neighbors	neighbor	NOUN
ajst-30556	117	8	is	be	AUX
ajst-30556	117	9	based	base	VERB
ajst-30556	117	10	on	on	ADP
ajst-30556	117	11	the	the	DET
ajst-30556	117	12	cumulative	cumulative	ADJ
ajst-30556	117	13	probability	probability	NOUN
ajst-30556	117	14	form	form	NOUN
ajst-30556	117	15	,	,	PUNCT
ajst-30556	117	16	the	the	DET
ajst-30556	117	17	variation	variation	NOUN
ajst-30556	117	18	coefficient	coefficient	NOUN
ajst-30556	117	19	is	be	AUX
ajst-30556	117	20	mapped	map	VERB
ajst-30556	117	21	to	to	ADP
ajst-30556	117	22	the	the	DET
ajst-30556	117	23	probability	probability	NOUN
ajst-30556	117	24	space	space	NOUN
ajst-30556	117	25	using	use	VERB
ajst-30556	117	26	the	the	DET
ajst-30556	117	27	softmax	softmax	NOUN
ajst-30556	117	28	function	function	NOUN
ajst-30556	117	29	as	as	SCONJ
ajst-30556	117	30	shown	show	VERB
ajst-30556	117	31	below	below	ADV
ajst-30556	117	32	:	:	PUNCT
ajst-30556	117	33	(	(	PUNCT
ajst-30556	117	34	|	|	ADV
ajst-30556	117	35	)	)	PUNCT
ajst-30556	117	36	(	(	PUNCT
ajst-30556	117	37	|	|	ADV
ajst-30556	117	38	)	)	PUNCT
ajst-30556	117	39	1	1	NUM
ajst-30556	117	40	sk	sk	INTJ
ajst-30556	118	1	i	i	PRON
ajst-30556	118	2	j	j	PROPN
ajst-30556	119	1	i	i	PRON
ajst-30556	119	2	i	i	PRON
ajst-30556	119	3	sk	sk	VERB
ajst-30556	119	4	i	i	PRON
ajst-30556	120	1	n	n	NOUN
ajst-30556	121	1	i	i	PRON
ajst-30556	122	1	i	i	INTJ
ajst-30556	122	2	x	x	VERB
ajst-30556	123	1	x	x	PUNCT
ajst-30556	123	2	j	j	NOUN
ajst-30556	123	3	i	i	PRON
ajst-30556	123	4	n	n	VERB
ajst-30556	123	5	i	i	NOUN
ajst-30556	123	6	x	x	PROPN
ajst-30556	124	1	x	x	VERB
ajst-30556	124	2	n	n	ADP
ajst-30556	124	3	ee	ee	ADP
ajst-30556	124	4	e	e	X
ajst-30556	124	5	(	(	PUNCT
ajst-30556	124	6	4	4	NUM
ajst-30556	124	7	)	)	PUNCT
ajst-30556	124	8	at	at	ADP
ajst-30556	124	9	this	this	DET
ajst-30556	124	10	point	point	NOUN
ajst-30556	124	11	,	,	PUNCT
ajst-30556	124	12	j	j	PROPN
ajst-30556	124	13	ie	ie	ADV
ajst-30556	124	14	represents	represent	VERB
ajst-30556	124	15	the	the	DET
ajst-30556	124	16	final	final	ADJ
ajst-30556	124	17	influence	influence	NOUN
ajst-30556	124	18	of	of	ADP
ajst-30556	124	19	the	the	DET
ajst-30556	124	20	neighbors	neighbor	NOUN
ajst-30556	124	21	.	.	PUNCT
ajst-30556	125	1	after	after	ADP
ajst-30556	125	2	the	the	DET
ajst-30556	125	3	spatial	spatial	ADJ
ajst-30556	125	4	mapping	mapping	NOUN
ajst-30556	125	5	using	use	VERB
ajst-30556	125	6	equation	equation	NOUN
ajst-30556	125	7	(	(	PUNCT
ajst-30556	125	8	4	4	NUM
ajst-30556	125	9	)	)	PUNCT
ajst-30556	125	10	,	,	PUNCT
ajst-30556	125	11	the	the	DET
ajst-30556	125	12	agent	agent	NOUN
ajst-30556	125	13	uses	use	VERB
ajst-30556	125	14	the	the	DET
ajst-30556	125	15	cumulative	cumulative	ADJ
ajst-30556	125	16	probability	probability	NOUN
ajst-30556	125	17	-	-	PUNCT
ajst-30556	125	18	based	base	VERB
ajst-30556	125	19	ignoring	ignore	VERB
ajst-30556	125	20	method	method	NOUN
ajst-30556	125	21	to	to	PART
ajst-30556	125	22	consider	consider	VERB
ajst-30556	125	23	the	the	DET
ajst-30556	125	24	set	set	NOUN
ajst-30556	125	25	of	of	ADP
ajst-30556	125	26	neighbors	neighbor	NOUN
ajst-30556	125	27	that	that	PRON
ajst-30556	125	28	should	should	AUX
ajst-30556	125	29	truly	truly	ADV
ajst-30556	125	30	be	be	AUX
ajst-30556	125	31	ignored	ignore	VERB
ajst-30556	125	32	with	with	ADP
ajst-30556	125	33	the	the	DET
ajst-30556	125	34	highest	high	ADJ
ajst-30556	125	35	likelihood	likelihood	NOUN
ajst-30556	125	36	.	.	PUNCT
ajst-30556	126	1	the	the	DET
ajst-30556	126	2	specific	specific	ADJ
ajst-30556	126	3	ignoring	ignore	VERB
ajst-30556	126	4	method	method	NOUN
ajst-30556	126	5	is	be	AUX
ajst-30556	126	6	shown	show	VERB
ajst-30556	126	7	in	in	ADP
ajst-30556	126	8	the	the	DET
ajst-30556	126	9	following	follow	VERB
ajst-30556	126	10	figure	figure	NOUN
ajst-30556	126	11	:	:	PUNCT
ajst-30556	126	12	figure	figure	NOUN
ajst-30556	126	13	2	2	NUM
ajst-30556	126	14	.	.	PUNCT
ajst-30556	127	1	the	the	DET
ajst-30556	127	2	probability	probability	NOUN
ajst-30556	127	3	-	-	PUNCT
ajst-30556	127	4	based	base	VERB
ajst-30556	127	5	ignoring	ignore	VERB
ajst-30556	127	6	strategy	strategy	NOUN
ajst-30556	127	7	in	in	ADP
ajst-30556	127	8	the	the	DET
ajst-30556	127	9	probability	probability	NOUN
ajst-30556	127	10	state	state	NOUN
ajst-30556	127	11	,	,	PUNCT
ajst-30556	127	12	to	to	PART
ajst-30556	127	13	escape	escape	VERB
ajst-30556	127	14	the	the	DET
ajst-30556	127	15	constraints	constraint	NOUN
ajst-30556	127	16	imposed	impose	VERB
ajst-30556	127	17	by	by	ADP
ajst-30556	127	18	strongly	strongly	ADV
ajst-30556	127	19	controlling	control	VERB
ajst-30556	127	20	neighbors	neighbor	NOUN
ajst-30556	128	1	,	,	PUNCT
ajst-30556	128	2	the	the	DET
ajst-30556	128	3	process	process	NOUN
ajst-30556	128	4	begins	begin	VERB
ajst-30556	128	5	with	with	ADP
ajst-30556	128	6	the	the	DET
ajst-30556	128	7	neighbor	neighbor	NOUN
ajst-30556	128	8	having	have	VERB
ajst-30556	128	9	the	the	DET
ajst-30556	128	10	smallest	small	ADJ
ajst-30556	128	11	probability	probability	NOUN
ajst-30556	128	12	value	value	NOUN
ajst-30556	128	13	.	.	PUNCT
ajst-30556	129	1	select	select	VERB
ajst-30556	129	2	a	a	DET
ajst-30556	129	3	random	random	ADJ
ajst-30556	129	4	number	number	NOUN
ajst-30556	129	5	jr	jr	PROPN
ajst-30556	129	6	between	between	ADP
ajst-30556	129	7	0	0	NUM
ajst-30556	129	8	and	and	CCONJ
ajst-30556	129	9	1	1	NUM
ajst-30556	129	10	.	.	PUNCT
ajst-30556	130	1	if	if	SCONJ
ajst-30556	130	2	j	j	PROPN
ajst-30556	130	3	i	i	PROPN
ajst-30556	130	4	je	je	PROPN
ajst-30556	130	5	r	r	NOUN
ajst-30556	130	6	,	,	PUNCT
ajst-30556	130	7	the	the	DET
ajst-30556	130	8	neighbor	neighbor	NOUN
ajst-30556	130	9	is	be	AUX
ajst-30556	130	10	considered	consider	VERB
ajst-30556	130	11	ignored	ignore	VERB
ajst-30556	130	12	.	.	PUNCT
ajst-30556	131	1	then	then	ADV
ajst-30556	131	2	,	,	PUNCT
ajst-30556	131	3	the	the	DET
ajst-30556	131	4	next	next	ADJ
ajst-30556	131	5	closest	close	ADJ
ajst-30556	131	6	neighbor	neighbor	NOUN
ajst-30556	131	7	1j	1j	NUM
ajst-30556	131	8	ie	ie	X
ajst-30556	131	9	is	be	AUX
ajst-30556	131	10	selected	select	VERB
ajst-30556	131	11	,	,	PUNCT
ajst-30556	131	12	and	and	CCONJ
ajst-30556	131	13	select	select	VERB
ajst-30556	131	14	another	another	DET
ajst-30556	131	15	random	random	ADJ
ajst-30556	131	16	number	number	NOUN
ajst-30556	131	17	1jr	1jr	NOUN
ajst-30556	131	18	.	.	PUNCT
ajst-30556	132	1	if	if	SCONJ
ajst-30556	132	2	1	1	NUM
ajst-30556	132	3	1	1	NUM
ajst-30556	132	4	j	j	NOUN
ajst-30556	132	5	j	j	PROPN
ajst-30556	133	1	j	j	PROPN
ajst-30556	134	1	i	i	INTJ
ajst-30556	134	2	ir	ir	VERB
ajst-30556	134	3	e	e	X
ajst-30556	134	4	e	e	PROPN
ajst-30556	134	5	,	,	PUNCT
ajst-30556	134	6	the	the	DET
ajst-30556	134	7	second	second	ADV
ajst-30556	134	8	-	-	PUNCT
ajst-30556	134	9	largest	large	ADJ
ajst-30556	134	10	neighbor	neighbor	NOUN
ajst-30556	134	11	is	be	AUX
ajst-30556	134	12	also	also	ADV
ajst-30556	134	13	ignored	ignore	VERB
ajst-30556	134	14	.	.	PUNCT
ajst-30556	135	1	this	this	DET
ajst-30556	135	2	process	process	NOUN
ajst-30556	135	3	repeats	repeat	VERB
ajst-30556	135	4	iteratively	iteratively	ADV
ajst-30556	135	5	until	until	SCONJ
ajst-30556	135	6	the	the	DET
ajst-30556	135	7	neglect	neglect	NOUN
ajst-30556	135	8	states	state	NOUN
ajst-30556	135	9	of	of	ADP
ajst-30556	135	10	all	all	DET
ajst-30556	135	11	neighbors	neighbor	NOUN
ajst-30556	135	12	are	be	AUX
ajst-30556	135	13	determined	determine	VERB
ajst-30556	135	14	.	.	PUNCT
ajst-30556	136	1	once	once	SCONJ
ajst-30556	136	2	the	the	DET
ajst-30556	136	3	neighbors	neighbor	NOUN
ajst-30556	136	4	are	be	AUX
ajst-30556	136	5	selected	select	VERB
ajst-30556	136	6	in	in	ADP
ajst-30556	136	7	the	the	DET
ajst-30556	136	8	current	current	ADJ
ajst-30556	136	9	local	local	ADJ
ajst-30556	136	10	optimum	optimum	ADJ
ajst-30556	136	11	phase	phase	NOUN
ajst-30556	136	12	,	,	PUNCT
ajst-30556	136	13	the	the	DET
ajst-30556	136	14	start	start	ADJ
ajst-30556	136	15	time	time	NOUN
ajst-30556	136	16	of	of	ADP
ajst-30556	136	17	the	the	DET
ajst-30556	136	18	local	local	ADJ
ajst-30556	136	19	optimum	optimum	ADJ
ajst-30556	136	20	phase	phase	NOUN
ajst-30556	136	21	is	be	AUX
ajst-30556	136	22	updated	update	VERB
ajst-30556	136	23	as	as	ADP
ajst-30556	136	24	iteration	iteration	NOUN
ajst-30556	136	25	to	to	PART
ajst-30556	136	26	be	be	AUX
ajst-30556	136	27	used	use	VERB
ajst-30556	136	28	for	for	ADP
ajst-30556	136	29	calculating	calculate	VERB
ajst-30556	136	30	the	the	DET
ajst-30556	136	31	influence	influence	NOUN
ajst-30556	136	32	in	in	ADP
ajst-30556	136	33	the	the	DET
ajst-30556	136	34	next	next	ADJ
ajst-30556	136	35	phase	phase	NOUN
ajst-30556	136	36	.	.	PUNCT
ajst-30556	137	1	under	under	ADP
ajst-30556	137	2	the	the	DET
ajst-30556	137	3	influence	influence	NOUN
ajst-30556	137	4	of	of	ADP
ajst-30556	137	5	the	the	DET
ajst-30556	137	6	probability	probability	NOUN
ajst-30556	137	7	-	-	PUNCT
ajst-30556	137	8	based	base	VERB
ajst-30556	137	9	ignoring	ignore	VERB
ajst-30556	137	10	mechanism	mechanism	NOUN
ajst-30556	137	11	based	base	VERB
ajst-30556	137	12	on	on	ADP
ajst-30556	137	13	influence	influence	NOUN
ajst-30556	137	14	,	,	PUNCT
ajst-30556	137	15	the	the	DET
ajst-30556	137	16	algorithm	algorithm	NOUN
ajst-30556	137	17	is	be	AUX
ajst-30556	137	18	highly	highly	ADV
ajst-30556	137	19	likely	likely	ADJ
ajst-30556	137	20	to	to	PART
ajst-30556	137	21	remain	remain	VERB
ajst-30556	137	22	in	in	ADP
ajst-30556	137	23	a	a	DET
ajst-30556	137	24	poor	poor	ADJ
ajst-30556	137	25	solution	solution	NOUN
ajst-30556	137	26	space	space	NOUN
ajst-30556	137	27	even	even	ADV
ajst-30556	137	28	after	after	ADP
ajst-30556	137	29	entering	enter	VERB
ajst-30556	137	30	a	a	DET
ajst-30556	137	31	new	new	ADJ
ajst-30556	137	32	solution	solution	NOUN
ajst-30556	137	33	space	space	NOUN
ajst-30556	137	34	.	.	PUNCT
ajst-30556	138	1	although	although	SCONJ
ajst-30556	138	2	the	the	DET
ajst-30556	138	3	ignored	ignore	VERB
ajst-30556	138	4	current	current	ADJ
ajst-30556	138	5	solution	solution	NOUN
ajst-30556	138	6	space	space	NOUN
ajst-30556	138	7	has	have	VERB
ajst-30556	138	8	great	great	ADJ
ajst-30556	138	9	potential	potential	NOUN
ajst-30556	138	10	to	to	PART
ajst-30556	138	11	find	find	VERB
ajst-30556	138	12	better	well	ADJ
ajst-30556	138	13	solutions	solution	NOUN
ajst-30556	138	14	,	,	PUNCT
ajst-30556	138	15	due	due	ADP
ajst-30556	138	16	to	to	ADP
ajst-30556	138	17	the	the	DET
ajst-30556	138	18	anytime	anytime	ADJ
ajst-30556	138	19	nature	nature	NOUN
ajst-30556	138	20	and	and	CCONJ
ajst-30556	138	21	the	the	DET
ajst-30556	138	22	high	high	ADJ
ajst-30556	138	23	complexity	complexity	NOUN
ajst-30556	138	24	of	of	ADP
ajst-30556	138	25	the	the	DET
ajst-30556	138	26	solution	solution	NOUN
ajst-30556	138	27	space	space	NOUN
ajst-30556	138	28	in	in	ADP
ajst-30556	138	29	continuous	continuous	ADJ
ajst-30556	138	30	distributed	distribute	VERB
ajst-30556	138	31	constraint	constraint	NOUN
ajst-30556	138	32	optimization	optimization	NOUN
ajst-30556	138	33	problems	problem	NOUN
ajst-30556	138	34	,	,	PUNCT
ajst-30556	138	35	the	the	DET
ajst-30556	138	36	algorithm	algorithm	NOUN
ajst-30556	138	37	may	may	AUX
ajst-30556	138	38	abandon	abandon	VERB
ajst-30556	138	39	246	246	NUM
ajst-30556	138	40	the	the	DET
ajst-30556	138	41	newly	newly	ADV
ajst-30556	138	42	found	find	VERB
ajst-30556	138	43	solution	solution	NOUN
ajst-30556	138	44	space	space	NOUN
ajst-30556	138	45	after	after	ADP
ajst-30556	138	46	a	a	DET
ajst-30556	138	47	comparison	comparison	NOUN
ajst-30556	138	48	of	of	ADP
ajst-30556	138	49	solution	solution	NOUN
ajst-30556	138	50	quality	quality	NOUN
ajst-30556	138	51	,	,	PUNCT
ajst-30556	138	52	thus	thus	ADV
ajst-30556	138	53	preventing	prevent	VERB
ajst-30556	138	54	it	it	PRON
ajst-30556	138	55	from	from	ADP
ajst-30556	138	56	escaping	escape	VERB
ajst-30556	138	57	the	the	DET
ajst-30556	138	58	local	local	ADJ
ajst-30556	138	59	optimum	optimum	NOUN
ajst-30556	138	60	.	.	PUNCT
ajst-30556	139	1	therefore	therefore	ADV
ajst-30556	139	2	,	,	PUNCT
ajst-30556	139	3	before	before	SCONJ
ajst-30556	139	4	the	the	DET
ajst-30556	139	5	algorithm	algorithm	NOUN
ajst-30556	139	6	enters	enter	VERB
ajst-30556	139	7	the	the	DET
ajst-30556	139	8	convergence	convergence	NOUN
ajst-30556	139	9	stage	stage	NOUN
ajst-30556	139	10	,	,	PUNCT
ajst-30556	139	11	it	it	PRON
ajst-30556	139	12	abandons	abandon	VERB
ajst-30556	139	13	the	the	DET
ajst-30556	139	14	anytime	anytime	ADJ
ajst-30556	139	15	property	property	NOUN
ajst-30556	139	16	for	for	ADP
ajst-30556	139	17	some	some	DET
ajst-30556	139	18	iterations	iteration	NOUN
ajst-30556	139	19	and	and	CCONJ
ajst-30556	139	20	develops	develop	VERB
ajst-30556	139	21	new	new	ADJ
ajst-30556	139	22	solution	solution	NOUN
ajst-30556	139	23	spaces	space	NOUN
ajst-30556	139	24	.	.	PUNCT
ajst-30556	140	1	in	in	ADP
ajst-30556	140	2	the	the	DET
ajst-30556	140	3	experiments	experiment	NOUN
ajst-30556	140	4	attached	attach	VERB
ajst-30556	140	5	later	later	ADV
ajst-30556	140	6	in	in	ADP
ajst-30556	140	7	this	this	DET
ajst-30556	140	8	paper	paper	NOUN
ajst-30556	140	9	,	,	PUNCT
ajst-30556	140	10	although	although	SCONJ
ajst-30556	140	11	the	the	DET
ajst-30556	140	12	algorithm	algorithm	NOUN
ajst-30556	140	13	's	's	PART
ajst-30556	140	14	curve	curve	NOUN
ajst-30556	140	15	may	may	AUX
ajst-30556	140	16	stay	stay	VERB
ajst-30556	140	17	in	in	ADP
ajst-30556	140	18	a	a	DET
ajst-30556	140	19	poor	poor	ADJ
ajst-30556	140	20	state	state	NOUN
ajst-30556	140	21	after	after	ADP
ajst-30556	140	22	certain	certain	ADJ
ajst-30556	140	23	ignoring	ignore	VERB
ajst-30556	140	24	phases	phase	NOUN
ajst-30556	140	25	,	,	PUNCT
ajst-30556	140	26	it	it	PRON
ajst-30556	140	27	still	still	ADV
ajst-30556	140	28	finds	find	VERB
ajst-30556	140	29	better	well	ADJ
ajst-30556	140	30	solution	solution	NOUN
ajst-30556	140	31	spaces	space	NOUN
ajst-30556	140	32	in	in	ADP
ajst-30556	140	33	subsequent	subsequent	ADJ
ajst-30556	140	34	optimization	optimization	NOUN
ajst-30556	140	35	stages	stage	NOUN
ajst-30556	140	36	than	than	ADP
ajst-30556	140	37	when	when	SCONJ
ajst-30556	140	38	it	it	PRON
ajst-30556	140	39	was	be	AUX
ajst-30556	140	40	trapped	trap	VERB
ajst-30556	140	41	in	in	ADP
ajst-30556	140	42	the	the	DET
ajst-30556	140	43	local	local	ADJ
ajst-30556	140	44	optimum	optimum	NOUN
ajst-30556	140	45	.	.	PUNCT
ajst-30556	141	1	before	before	ADP
ajst-30556	141	2	the	the	DET
ajst-30556	141	3	final	final	ADJ
ajst-30556	141	4	convergence	convergence	NOUN
ajst-30556	141	5	,	,	PUNCT
ajst-30556	141	6	the	the	DET
ajst-30556	141	7	algorithm	algorithm	NOUN
ajst-30556	141	8	successfully	successfully	ADV
ajst-30556	141	9	escapes	escape	VERB
ajst-30556	141	10	from	from	ADP
ajst-30556	141	11	the	the	DET
ajst-30556	141	12	local	local	ADJ
ajst-30556	141	13	optimum	optimum	NOUN
ajst-30556	141	14	each	each	DET
ajst-30556	141	15	time	time	NOUN
ajst-30556	141	16	it	it	PRON
ajst-30556	141	17	reaches	reach	VERB
ajst-30556	141	18	a	a	DET
ajst-30556	141	19	new	new	ADJ
ajst-30556	141	20	local	local	ADJ
ajst-30556	141	21	optimum	optimum	NOUN
ajst-30556	141	22	and	and	CCONJ
ajst-30556	141	23	ultimately	ultimately	ADV
ajst-30556	141	24	achieves	achieve	VERB
ajst-30556	141	25	better	well	ADJ
ajst-30556	141	26	solutions	solution	NOUN
ajst-30556	141	27	.	.	PUNCT
ajst-30556	142	1	3.3	3.3	NUM
ajst-30556	142	2	.	.	PUNCT
ajst-30556	143	1	complexity	complexity	NOUN
ajst-30556	143	2	analysis	analysis	NOUN
ajst-30556	143	3	given	give	VERB
ajst-30556	143	4	that	that	SCONJ
ajst-30556	143	5	the	the	DET
ajst-30556	143	6	problem	problem	NOUN
ajst-30556	143	7	topology	topology	NOUN
ajst-30556	143	8	of	of	ADP
ajst-30556	143	9	the	the	DET
ajst-30556	143	10	algorithm	algorithm	NOUN
ajst-30556	143	11	is	be	AUX
ajst-30556	143	12	a	a	DET
ajst-30556	143	13	fully	fully	ADV
ajst-30556	143	14	connected	connect	VERB
ajst-30556	143	15	graph	graph	NOUN
ajst-30556	143	16	with	with	ADP
ajst-30556	143	17	n	n	PROPN
ajst-30556	143	18	agents	agent	NOUN
ajst-30556	143	19	,	,	PUNCT
ajst-30556	143	20	the	the	DET
ajst-30556	143	21	algorithm	algorithm	NOUN
ajst-30556	143	22	's	's	PART
ajst-30556	143	23	complexity	complexity	NOUN
ajst-30556	143	24	primarily	primarily	ADV
ajst-30556	143	25	consists	consist	VERB
ajst-30556	143	26	of	of	ADP
ajst-30556	143	27	space	space	NOUN
ajst-30556	143	28	complexity	complexity	NOUN
ajst-30556	143	29	and	and	CCONJ
ajst-30556	143	30	time	time	NOUN
ajst-30556	143	31	complexity	complexity	NOUN
ajst-30556	143	32	.	.	PUNCT
ajst-30556	144	1	in	in	ADP
ajst-30556	144	2	hfda	hfda	PROPN
ajst-30556	144	3	,	,	PUNCT
ajst-30556	144	4	agents	agent	NOUN
ajst-30556	144	5	must	must	AUX
ajst-30556	144	6	store	store	VERB
ajst-30556	144	7	historical	historical	ADJ
ajst-30556	144	8	values	value	NOUN
ajst-30556	144	9	for	for	ADP
ajst-30556	144	10	each	each	DET
ajst-30556	144	11	iteration	iteration	NOUN
ajst-30556	144	12	before	before	ADP
ajst-30556	144	13	reaching	reach	VERB
ajst-30556	144	14	a	a	DET
ajst-30556	144	15	local	local	ADJ
ajst-30556	144	16	optimum	optimum	NOUN
ajst-30556	144	17	,	,	PUNCT
ajst-30556	144	18	resulting	result	VERB
ajst-30556	144	19	in	in	ADP
ajst-30556	144	20	a	a	DET
ajst-30556	144	21	space	space	NOUN
ajst-30556	144	22	complexity	complexity	NOUN
ajst-30556	144	23	of	of	ADP
ajst-30556	144	24	(	(	PUNCT
ajst-30556	144	25	)	)	PUNCT
ajst-30556	144	26	o	o	NOUN
ajst-30556	144	27	n	n	NOUN
ajst-30556	144	28	.	.	PUNCT
ajst-30556	145	1	the	the	DET
ajst-30556	145	2	total	total	ADJ
ajst-30556	145	3	storage	storage	NOUN
ajst-30556	145	4	overhead	overhead	ADV
ajst-30556	145	5	for	for	ADP
ajst-30556	145	6	the	the	DET
ajst-30556	145	7	entire	entire	ADJ
ajst-30556	145	8	iterative	iterative	NOUN
ajst-30556	145	9	process	process	NOUN
ajst-30556	145	10	is	be	AUX
ajst-30556	145	11	given	give	VERB
ajst-30556	145	12	by	by	ADP
ajst-30556	145	13	:	:	PUNCT
ajst-30556	145	14	(	(	PUNCT
ajst-30556	145	15	*	*	PUNCT
ajst-30556	145	16	)	)	PUNCT
ajst-30556	145	17	o	o	NOUN
ajst-30556	145	18	n	n	PRON
ajst-30556	145	19	maxiterations	maxiteration	NOUN
ajst-30556	145	20	.	.	PUNCT
ajst-30556	146	1	during	during	ADP
ajst-30556	146	2	the	the	DET
ajst-30556	146	3	initialization	initialization	NOUN
ajst-30556	146	4	and	and	CCONJ
ajst-30556	146	5	non	non	ADJ
ajst-30556	146	6	-	-	ADJ
ajst-30556	146	7	neglect	neglect	ADJ
ajst-30556	146	8	phases	phase	NOUN
ajst-30556	146	9	,	,	PUNCT
ajst-30556	146	10	only	only	ADV
ajst-30556	146	11	population	population	NOUN
ajst-30556	146	12	and	and	CCONJ
ajst-30556	146	13	numerical	numerical	ADJ
ajst-30556	146	14	information	information	NOUN
ajst-30556	146	15	need	need	VERB
ajst-30556	146	16	to	to	PART
ajst-30556	146	17	be	be	AUX
ajst-30556	146	18	transmitted	transmit	VERB
ajst-30556	146	19	in	in	ADP
ajst-30556	146	20	each	each	DET
ajst-30556	146	21	iteration	iteration	NOUN
ajst-30556	146	22	,	,	PUNCT
ajst-30556	146	23	resulting	result	VERB
ajst-30556	146	24	in	in	ADP
ajst-30556	146	25	a	a	DET
ajst-30556	146	26	message	message	NOUN
ajst-30556	146	27	size	size	NOUN
ajst-30556	146	28	of	of	ADP
ajst-30556	146	29	(	(	PUNCT
ajst-30556	146	30	)	)	PUNCT
ajst-30556	146	31	o	o	NOUN
ajst-30556	146	32	n	n	NOUN
ajst-30556	146	33	.	.	PUNCT
ajst-30556	147	1	when	when	SCONJ
ajst-30556	147	2	computing	compute	VERB
ajst-30556	147	3	local	local	ADJ
ajst-30556	147	4	costs	cost	NOUN
ajst-30556	147	5	,	,	PUNCT
ajst-30556	147	6	an	an	DET
ajst-30556	147	7	agent	agent	NOUN
ajst-30556	147	8	must	must	AUX
ajst-30556	147	9	iterate	iterate	VERB
ajst-30556	147	10	over	over	ADP
ajst-30556	147	11	all	all	DET
ajst-30556	147	12	its	its	PRON
ajst-30556	147	13	neighbors	neighbor	NOUN
ajst-30556	147	14	,	,	PUNCT
ajst-30556	147	15	leading	lead	VERB
ajst-30556	147	16	to	to	ADP
ajst-30556	147	17	a	a	DET
ajst-30556	147	18	complexity	complexity	NOUN
ajst-30556	147	19	of	of	ADP
ajst-30556	147	20	(	(	PUNCT
ajst-30556	147	21	)	)	PUNCT
ajst-30556	147	22	o	o	NOUN
ajst-30556	147	23	n	n	NOUN
ajst-30556	147	24	.	.	PUNCT
ajst-30556	148	1	consequently	consequently	ADV
ajst-30556	148	2	,	,	PUNCT
ajst-30556	148	3	in	in	ADP
ajst-30556	148	4	a	a	DET
ajst-30556	148	5	fully	fully	ADV
ajst-30556	148	6	connected	connect	VERB
ajst-30556	148	7	graph	graph	NOUN
ajst-30556	148	8	,	,	PUNCT
ajst-30556	148	9	the	the	DET
ajst-30556	148	10	total	total	ADJ
ajst-30556	148	11	complexity	complexity	NOUN
ajst-30556	148	12	for	for	ADP
ajst-30556	148	13	all	all	DET
ajst-30556	148	14	agents	agent	NOUN
ajst-30556	148	15	across	across	ADP
ajst-30556	148	16	all	all	DET
ajst-30556	148	17	iterations	iteration	NOUN
ajst-30556	148	18	is	be	AUX
ajst-30556	148	19	:	:	PUNCT
ajst-30556	148	20	(	(	PUNCT
ajst-30556	148	21	*	*	PUNCT
ajst-30556	148	22	*	*	PUNCT
ajst-30556	148	23	)	)	PUNCT
ajst-30556	148	24	o	o	NOUN
ajst-30556	148	25	n	n	CCONJ
ajst-30556	148	26	n	n	PRON
ajst-30556	148	27	maxiterations	maxiteration	NOUN
ajst-30556	148	28	(	(	PUNCT
ajst-30556	148	29	5	5	NUM
ajst-30556	148	30	)	)	PUNCT
ajst-30556	148	31	the	the	DET
ajst-30556	148	32	time	time	NOUN
ajst-30556	148	33	complexity	complexity	NOUN
ajst-30556	148	34	of	of	ADP
ajst-30556	148	35	hfda	hfda	PROPN
ajst-30556	148	36	primarily	primarily	ADV
ajst-30556	148	37	depends	depend	VERB
ajst-30556	148	38	on	on	ADP
ajst-30556	148	39	the	the	DET
ajst-30556	148	40	construction	construction	NOUN
ajst-30556	148	41	of	of	ADP
ajst-30556	148	42	influence	influence	NOUN
ajst-30556	148	43	during	during	ADP
ajst-30556	148	44	the	the	DET
ajst-30556	148	45	neglect	neglect	NOUN
ajst-30556	148	46	phase	phase	NOUN
ajst-30556	148	47	.	.	PUNCT
ajst-30556	149	1	since	since	SCONJ
ajst-30556	149	2	agents	agent	NOUN
ajst-30556	149	3	iterate	iterate	VERB
ajst-30556	149	4	at	at	ADP
ajst-30556	149	5	each	each	DET
ajst-30556	149	6	step	step	NOUN
ajst-30556	149	7	when	when	SCONJ
ajst-30556	149	8	in	in	ADP
ajst-30556	149	9	a	a	DET
ajst-30556	149	10	local	local	ADJ
ajst-30556	149	11	optimum	optimum	ADJ
ajst-30556	149	12	or	or	CCONJ
ajst-30556	149	13	stagnation	stagnation	NOUN
ajst-30556	149	14	state	state	NOUN
ajst-30556	149	15	,	,	PUNCT
ajst-30556	149	16	the	the	DET
ajst-30556	149	17	time	time	NOUN
ajst-30556	149	18	cost	cost	NOUN
ajst-30556	149	19	can	can	AUX
ajst-30556	149	20	be	be	AUX
ajst-30556	149	21	expressed	express	VERB
ajst-30556	149	22	as	as	ADP
ajst-30556	149	23	:	:	PUNCT
ajst-30556	149	24	o(|	o(|	ADJ
ajst-30556	149	25	n	n	PRON
ajst-30556	149	26	|*maxiteration+	|*maxiteration+	NOUN
ajst-30556	150	1	|	|	ADV
ajst-30556	150	2	n	n	ADV
ajst-30556	150	3	|	|	NOUN
ajst-30556	150	4	*	*	PUNCT
ajst-30556	150	5	|	|	ADV
ajst-30556	150	6	n	n	PRON
ajst-30556	150	7	|*maxiteration	|*maxiteration	NOUN
ajst-30556	150	8	)	)	PUNCT
ajst-30556	150	9	(	(	PUNCT
ajst-30556	150	10	6	6	NUM
ajst-30556	150	11	)	)	SYM
ajst-30556	150	12	4	4	NUM
ajst-30556	150	13	.	.	PUNCT
ajst-30556	150	14	experimental	experimental	ADJ
ajst-30556	150	15	result	result	NOUN
ajst-30556	150	16	and	and	CCONJ
ajst-30556	150	17	analysis	analysis	NOUN
ajst-30556	150	18	to	to	PART
ajst-30556	150	19	verify	verify	VERB
ajst-30556	150	20	the	the	DET
ajst-30556	150	21	effectiveness	effectiveness	NOUN
ajst-30556	150	22	of	of	ADP
ajst-30556	150	23	the	the	DET
ajst-30556	150	24	hfda	hfda	ADJ
ajst-30556	150	25	algorithm	algorithm	NOUN
ajst-30556	150	26	,	,	PUNCT
ajst-30556	150	27	this	this	DET
ajst-30556	150	28	paper	paper	NOUN
ajst-30556	150	29	conducts	conduct	VERB
ajst-30556	150	30	an	an	DET
ajst-30556	150	31	experimental	experimental	ADJ
ajst-30556	150	32	evaluation	evaluation	NOUN
ajst-30556	150	33	of	of	ADP
ajst-30556	150	34	pfd	pfd	PROPN
ajst-30556	150	35	,	,	PUNCT
ajst-30556	150	36	ccocoa	ccocoa	PROPN
ajst-30556	150	37	,	,	PUNCT
ajst-30556	150	38	pfd	pfd	PROPN
ajst-30556	150	39	-	-	PUNCT
ajst-30556	150	40	ld	ld	PROPN
ajst-30556	150	41	,	,	PUNCT
ajst-30556	150	42	and	and	CCONJ
ajst-30556	150	43	amcga	amcga	VERB
ajst-30556	150	44	against	against	ADP
ajst-30556	150	45	hfda	hfda	PROPN
ajst-30556	150	46	on	on	ADP
ajst-30556	150	47	two	two	NUM
ajst-30556	150	48	different	different	ADJ
ajst-30556	150	49	benchmark	benchmark	NOUN
ajst-30556	150	50	problems(random	problems(random	NOUN
ajst-30556	150	51	dense	dense	ADJ
ajst-30556	150	52	graph	graph	NOUN
ajst-30556	150	53	and	and	CCONJ
ajst-30556	150	54	scale	scale	VERB
ajst-30556	150	55	free	free	ADJ
ajst-30556	150	56	network	network	NOUN
ajst-30556	150	57	)	)	PUNCT
ajst-30556	150	58	.	.	PUNCT
ajst-30556	151	1	since	since	SCONJ
ajst-30556	151	2	an	an	DET
ajst-30556	151	3	algorithm	algorithm	NOUN
ajst-30556	151	4	may	may	AUX
ajst-30556	151	5	exhibit	exhibit	VERB
ajst-30556	151	6	varying	vary	VERB
ajst-30556	151	7	random	random	ADJ
ajst-30556	151	8	performance	performance	NOUN
ajst-30556	151	9	across	across	ADP
ajst-30556	151	10	multiple	multiple	ADJ
ajst-30556	151	11	runs	run	NOUN
ajst-30556	151	12	,	,	PUNCT
ajst-30556	151	13	this	this	DET
ajst-30556	151	14	experiment	experiment	NOUN
ajst-30556	151	15	analyzes	analyze	VERB
ajst-30556	151	16	the	the	DET
ajst-30556	151	17	statistical	statistical	ADJ
ajst-30556	151	18	characteristics	characteristic	NOUN
ajst-30556	151	19	of	of	ADP
ajst-30556	151	20	30	30	NUM
ajst-30556	151	21	runs	run	NOUN
ajst-30556	151	22	for	for	ADP
ajst-30556	151	23	each	each	DET
ajst-30556	151	24	algorithm	algorithm	NOUN
ajst-30556	151	25	on	on	ADP
ajst-30556	151	26	each	each	DET
ajst-30556	151	27	problem	problem	NOUN
ajst-30556	151	28	model	model	NOUN
ajst-30556	151	29	.	.	PUNCT
ajst-30556	152	1	to	to	PART
ajst-30556	152	2	ensure	ensure	VERB
ajst-30556	152	3	fairness	fairness	NOUN
ajst-30556	152	4	,	,	PUNCT
ajst-30556	152	5	all	all	DET
ajst-30556	152	6	algorithms	algorithm	NOUN
ajst-30556	152	7	adopt	adopt	VERB
ajst-30556	152	8	a	a	DET
ajst-30556	152	9	maximum	maximum	NOUN
ajst-30556	152	10	of	of	ADP
ajst-30556	152	11	500	500	NUM
ajst-30556	152	12	iterations	iteration	NOUN
ajst-30556	152	13	as	as	ADP
ajst-30556	152	14	the	the	DET
ajst-30556	152	15	termination	termination	NOUN
ajst-30556	152	16	condition	condition	NOUN
ajst-30556	152	17	.	.	PUNCT
ajst-30556	153	1	the	the	DET
ajst-30556	153	2	experimental	experimental	ADJ
ajst-30556	153	3	configuration	configuration	NOUN
ajst-30556	153	4	for	for	ADP
ajst-30556	153	5	these	these	DET
ajst-30556	153	6	two	two	NUM
ajst-30556	153	7	types	type	NOUN
ajst-30556	153	8	of	of	ADP
ajst-30556	153	9	problems	problem	NOUN
ajst-30556	153	10	is	be	AUX
ajst-30556	153	11	as	as	SCONJ
ajst-30556	153	12	follows	follow	VERB
ajst-30556	153	13	,	,	PUNCT
ajst-30556	153	14	random	random	ADJ
ajst-30556	153	15	graphs	graph	NOUN
ajst-30556	153	16	are	be	AUX
ajst-30556	153	17	classified	classify	VERB
ajst-30556	153	18	into	into	ADP
ajst-30556	153	19	dense	dense	ADJ
ajst-30556	153	20	and	and	CCONJ
ajst-30556	153	21	sparse	sparse	ADJ
ajst-30556	153	22	graphs	graph	NOUN
ajst-30556	153	23	,	,	PUNCT
ajst-30556	153	24	with	with	ADP
ajst-30556	153	25	problem	problem	NOUN
ajst-30556	153	26	densities	density	NOUN
ajst-30556	153	27	of	of	ADP
ajst-30556	153	28	0.6	0.6	NUM
ajst-30556	153	29	and	and	CCONJ
ajst-30556	153	30	0.1	0.1	NUM
ajst-30556	153	31	,	,	PUNCT
ajst-30556	153	32	respectively	respectively	ADV
ajst-30556	153	33	.	.	PUNCT
ajst-30556	154	1	the	the	DET
ajst-30556	154	2	number	number	NOUN
ajst-30556	154	3	of	of	ADP
ajst-30556	154	4	agents	agent	NOUN
ajst-30556	154	5	ranges	range	VERB
ajst-30556	154	6	from	from	ADP
ajst-30556	154	7	50	50	NUM
ajst-30556	154	8	to	to	PART
ajst-30556	154	9	100	100	NUM
ajst-30556	154	10	.	.	PUNCT
ajst-30556	155	1	in	in	ADP
ajst-30556	155	2	the	the	DET
ajst-30556	155	3	scale	scale	NOUN
ajst-30556	155	4	-	-	PUNCT
ajst-30556	155	5	free	free	ADJ
ajst-30556	155	6	network	network	NOUN
ajst-30556	155	7	structure	structure	NOUN
ajst-30556	155	8	,	,	PUNCT
ajst-30556	155	9	1	1	NUM
ajst-30556	155	10	m	m	NOUN
ajst-30556	155	11	=	=	NOUN
ajst-30556	155	12	10	10	NUM
ajst-30556	155	13	and	and	CCONJ
ajst-30556	155	14	2	2	NUM
ajst-30556	155	15	m	m	NOUN
ajst-30556	155	16	=	=	NOUN
ajst-30556	155	17	7	7	NUM
ajst-30556	155	18	,	,	PUNCT
ajst-30556	155	19	with	with	ADP
ajst-30556	155	20	the	the	DET
ajst-30556	155	21	number	number	NOUN
ajst-30556	155	22	of	of	ADP
ajst-30556	155	23	agents	agent	NOUN
ajst-30556	155	24	also	also	ADV
ajst-30556	155	25	ranging	range	VERB
ajst-30556	155	26	from	from	ADP
ajst-30556	155	27	50	50	NUM
ajst-30556	155	28	to	to	PART
ajst-30556	155	29	100	100	NUM
ajst-30556	155	30	.	.	PUNCT
ajst-30556	156	1	this	this	DET
ajst-30556	156	2	paper	paper	NOUN
ajst-30556	156	3	uniformly	uniformly	ADV
ajst-30556	156	4	uses	use	VERB
ajst-30556	156	5	the	the	DET
ajst-30556	156	6	form	form	NOUN
ajst-30556	156	7	of	of	ADP
ajst-30556	156	8	the	the	DET
ajst-30556	156	9	constraint	constraint	NOUN
ajst-30556	156	10	function	function	NOUN
ajst-30556	156	11	2	2	NUM
ajst-30556	156	12	2ax	2ax	NOUN
ajst-30556	156	13	bx	bx	PROPN
ajst-30556	156	14	cxy	cxy	PROPN
ajst-30556	156	15	dy	dy	VERB
ajst-30556	156	16	ey	ey	PROPN
ajst-30556	156	17	f	f	PROPN
ajst-30556	156	18	,	,	PUNCT
ajst-30556	156	19	where	where	SCONJ
ajst-30556	156	20	all	all	DET
ajst-30556	156	21	coefficients	coefficient	NOUN
ajst-30556	156	22	of	of	ADP
ajst-30556	156	23	the	the	DET
ajst-30556	156	24	polynomial	polynomial	NOUN
ajst-30556	156	25	are	be	AUX
ajst-30556	156	26	randomly	randomly	ADV
ajst-30556	156	27	generated	generate	VERB
ajst-30556	156	28	from	from	ADP
ajst-30556	156	29	the	the	DET
ajst-30556	156	30	interval	interval	NOUN
ajst-30556	156	31	[	[	PUNCT
ajst-30556	156	32	5,5	5,5	NUM
ajst-30556	156	33	]	]	PUNCT
ajst-30556	156	34	.	.	PUNCT
ajst-30556	157	1	for	for	ADP
ajst-30556	157	2	the	the	DET
ajst-30556	157	3	non	non	ADJ
ajst-30556	157	4	-	-	ADJ
ajst-30556	157	5	iterative	iterative	ADJ
ajst-30556	157	6	algorithm	algorithm	NOUN
ajst-30556	157	7	ccocoa	ccocoa	NOUN
ajst-30556	157	8	,	,	PUNCT
ajst-30556	157	9	according	accord	VERB
ajst-30556	157	10	to	to	ADP
ajst-30556	157	11	the	the	DET
ajst-30556	157	12	settings	setting	NOUN
ajst-30556	157	13	from	from	ADP
ajst-30556	157	14	the	the	DET
ajst-30556	157	15	original	original	ADJ
ajst-30556	157	16	paper	paper	NOUN
ajst-30556	157	17	,	,	PUNCT
ajst-30556	157	18	the	the	DET
ajst-30556	157	19	number	number	NOUN
ajst-30556	157	20	of	of	ADP
ajst-30556	157	21	discretization	discretization	NOUN
ajst-30556	157	22	points	point	NOUN
ajst-30556	157	23	for	for	ADP
ajst-30556	157	24	the	the	DET
ajst-30556	157	25	value	value	NOUN
ajst-30556	157	26	range	range	NOUN
ajst-30556	157	27	is	be	AUX
ajst-30556	157	28	set	set	VERB
ajst-30556	157	29	to	to	ADP
ajst-30556	157	30	3	3	NUM
ajst-30556	157	31	,	,	PUNCT
ajst-30556	157	32	the	the	DET
ajst-30556	157	33	number	number	NOUN
ajst-30556	157	34	of	of	ADP
ajst-30556	157	35	nonlinear	nonlinear	ADJ
ajst-30556	157	36	optimization	optimization	NOUN
ajst-30556	157	37	iterations	iteration	NOUN
ajst-30556	157	38	is	be	AUX
ajst-30556	157	39	set	set	VERB
ajst-30556	157	40	to	to	ADP
ajst-30556	157	41	100	100	NUM
ajst-30556	157	42	,	,	PUNCT
ajst-30556	157	43	and	and	CCONJ
ajst-30556	157	44	the	the	DET
ajst-30556	157	45	learning	learning	NOUN
ajst-30556	157	46	rate	rate	NOUN
ajst-30556	157	47	is	be	AUX
ajst-30556	157	48	set	set	VERB
ajst-30556	157	49	to	to	ADP
ajst-30556	157	50	0.01	0.01	NUM
ajst-30556	157	51	.	.	PUNCT
ajst-30556	158	1	4.1	4.1	NUM
ajst-30556	158	2	.	.	PUNCT
ajst-30556	158	3	convergence	convergence	NOUN
ajst-30556	158	4	experiment	experiment	NOUN
ajst-30556	158	5	to	to	PART
ajst-30556	158	6	directly	directly	ADV
ajst-30556	158	7	compare	compare	VERB
ajst-30556	158	8	the	the	DET
ajst-30556	158	9	performance	performance	NOUN
ajst-30556	158	10	differences	difference	NOUN
ajst-30556	158	11	between	between	ADP
ajst-30556	158	12	hfda	hfda	PROPN
ajst-30556	158	13	and	and	CCONJ
ajst-30556	158	14	the	the	DET
ajst-30556	158	15	other	other	ADJ
ajst-30556	158	16	four	four	NUM
ajst-30556	158	17	algorithms	algorithm	NOUN
ajst-30556	158	18	,	,	PUNCT
ajst-30556	158	19	fig.1	fig.1	PROPN
ajst-30556	158	20	and	and	CCONJ
ajst-30556	158	21	fig.2	fig.2	PROPN
ajst-30556	158	22	present	present	VERB
ajst-30556	158	23	the	the	DET
ajst-30556	158	24	convergence	convergence	NOUN
ajst-30556	158	25	diagrams	diagram	NOUN
ajst-30556	158	26	of	of	ADP
ajst-30556	158	27	hfda	hfda	PROPN
ajst-30556	158	28	in	in	ADP
ajst-30556	158	29	random	random	ADJ
ajst-30556	158	30	graph(with	graph(with	PROPN
ajst-30556	158	31	100	100	NUM
ajst-30556	158	32	agents	agent	NOUN
ajst-30556	158	33	,	,	PUNCT
ajst-30556	158	34	density=0.6/0.1	density=0.6/0.1	PROPN
ajst-30556	158	35	)	)	PUNCT
ajst-30556	158	36	.	.	PUNCT
ajst-30556	159	1	figure	figure	VERB
ajst-30556	159	2	3	3	NUM
ajst-30556	159	3	.	.	PUNCT
ajst-30556	159	4	convergence	convergence	NOUN
ajst-30556	159	5	curve	curve	NOUN
ajst-30556	159	6	of	of	ADP
ajst-30556	159	7	hfda	hfda	PROPN
ajst-30556	159	8	and	and	CCONJ
ajst-30556	159	9	other	other	ADJ
ajst-30556	159	10	algorithms	algorithm	NOUN
ajst-30556	159	11	on	on	ADP
ajst-30556	159	12	a	a	DET
ajst-30556	159	13	random	random	ADJ
ajst-30556	159	14	dense	dense	ADJ
ajst-30556	159	15	graph	graph	NOUN
ajst-30556	159	16	figure	figure	NOUN
ajst-30556	159	17	4	4	NUM
ajst-30556	159	18	.	.	PUNCT
ajst-30556	159	19	convergence	convergence	NOUN
ajst-30556	159	20	curve	curve	NOUN
ajst-30556	159	21	of	of	ADP
ajst-30556	159	22	hfda	hfda	PROPN
ajst-30556	159	23	and	and	CCONJ
ajst-30556	159	24	other	other	ADJ
ajst-30556	159	25	algorithms	algorithm	NOUN
ajst-30556	159	26	on	on	ADP
ajst-30556	159	27	a	a	DET
ajst-30556	159	28	random	random	ADJ
ajst-30556	159	29	sparse	sparse	ADJ
ajst-30556	159	30	graph	graph	NOUN
ajst-30556	159	31	according	accord	VERB
ajst-30556	159	32	to	to	ADP
ajst-30556	159	33	fig.3	fig.3	PROPN
ajst-30556	159	34	and	and	CCONJ
ajst-30556	159	35	fig.4	fig.4	PROPN
ajst-30556	159	36	,	,	PUNCT
ajst-30556	159	37	as	as	ADP
ajst-30556	159	38	the	the	DET
ajst-30556	159	39	number	number	NOUN
ajst-30556	159	40	of	of	ADP
ajst-30556	159	41	iterations	iteration	NOUN
ajst-30556	159	42	increases	increase	NOUN
ajst-30556	159	43	,	,	PUNCT
ajst-30556	159	44	hfda	hfda	PROPN
ajst-30556	159	45	initially	initially	ADV
ajst-30556	159	46	falls	fall	VERB
ajst-30556	159	47	into	into	ADP
ajst-30556	159	48	a	a	DET
ajst-30556	159	49	local	local	ADJ
ajst-30556	159	50	optimum	optimum	NOUN
ajst-30556	159	51	.	.	PUNCT
ajst-30556	160	1	however	however	ADV
ajst-30556	160	2	,	,	PUNCT
ajst-30556	160	3	due	due	ADP
ajst-30556	160	4	to	to	ADP
ajst-30556	160	5	the	the	DET
ajst-30556	160	6	activation	activation	NOUN
ajst-30556	160	7	of	of	ADP
ajst-30556	160	8	influence	influence	NOUN
ajst-30556	160	9	computation	computation	NOUN
ajst-30556	160	10	and	and	CCONJ
ajst-30556	160	11	the	the	DET
ajst-30556	160	12	ignoring	ignoring	NOUN
ajst-30556	160	13	of	of	ADP
ajst-30556	160	14	neighbor	neighbor	NOUN
ajst-30556	160	15	values	value	NOUN
ajst-30556	160	16	,	,	PUNCT
ajst-30556	160	17	hfda	hfda	PROPN
ajst-30556	160	18	continues	continue	VERB
ajst-30556	160	19	exploring	explore	VERB
ajst-30556	160	20	new	new	ADJ
ajst-30556	160	21	solution	solution	NOUN
ajst-30556	160	22	spaces	space	NOUN
ajst-30556	160	23	and	and	CCONJ
ajst-30556	160	24	outperforms	outperform	VERB
ajst-30556	160	25	other	other	ADJ
ajst-30556	160	26	algorithms	algorithm	NOUN
ajst-30556	160	27	.	.	PUNCT
ajst-30556	161	1	amcga	amcga	PROPN
ajst-30556	161	2	also	also	ADV
ajst-30556	161	3	demonstrates	demonstrate	VERB
ajst-30556	161	4	good	good	ADJ
ajst-30556	161	5	convergence	convergence	NOUN
ajst-30556	161	6	quality	quality	NOUN
ajst-30556	161	7	as	as	ADP
ajst-30556	161	8	iterations	iteration	NOUN
ajst-30556	161	9	progress	progress	NOUN
ajst-30556	161	10	,	,	PUNCT
ajst-30556	161	11	but	but	CCONJ
ajst-30556	161	12	since	since	SCONJ
ajst-30556	161	13	it	it	PRON
ajst-30556	161	14	lacks	lack	VERB
ajst-30556	161	15	a	a	DET
ajst-30556	161	16	mechanism	mechanism	NOUN
ajst-30556	161	17	to	to	PART
ajst-30556	161	18	escape	escape	VERB
ajst-30556	161	19	local	local	ADJ
ajst-30556	161	20	optima	optima	NOUN
ajst-30556	161	21	,	,	PUNCT
ajst-30556	161	22	its	its	PRON
ajst-30556	161	23	final	final	ADJ
ajst-30556	161	24	convergence	convergence	NOUN
ajst-30556	161	25	result	result	VERB
ajst-30556	161	26	two	two	NUM
ajst-30556	161	27	figures	figure	NOUN
ajst-30556	161	28	remain	remain	VERB
ajst-30556	161	29	inferior	inferior	ADJ
ajst-30556	161	30	to	to	ADP
ajst-30556	161	31	that	that	PRON
ajst-30556	161	32	of	of	ADP
ajst-30556	161	33	hfda	hfda	PROPN
ajst-30556	161	34	.	.	PUNCT
ajst-30556	162	1	the	the	DET
ajst-30556	162	2	following	follow	VERB
ajst-30556	162	3	presents	present	VERB
ajst-30556	162	4	the	the	DET
ajst-30556	162	5	performance	performance	NOUN
ajst-30556	162	6	comparison	comparison	NOUN
ajst-30556	162	7	of	of	ADP
ajst-30556	162	8	hfda	hfda	PROPN
ajst-30556	162	9	in	in	ADP
ajst-30556	162	10	scale	scale	NOUN
ajst-30556	162	11	-	-	PUNCT
ajst-30556	162	12	free	free	ADJ
ajst-30556	162	13	networks	network	NOUN
ajst-30556	162	14	.	.	PUNCT
ajst-30556	163	1	247	247	NUM
ajst-30556	163	2	figure	figure	NOUN
ajst-30556	163	3	5	5	NUM
ajst-30556	163	4	.	.	PUNCT
ajst-30556	163	5	convergence	convergence	NOUN
ajst-30556	163	6	curve	curve	NOUN
ajst-30556	163	7	of	of	ADP
ajst-30556	163	8	hfda	hfda	PROPN
ajst-30556	163	9	and	and	CCONJ
ajst-30556	163	10	other	other	ADJ
ajst-30556	163	11	algorithms	algorithm	NOUN
ajst-30556	163	12	on	on	ADP
ajst-30556	163	13	a	a	DET
ajst-30556	163	14	random	random	ADJ
ajst-30556	163	15	sparse	sparse	ADJ
ajst-30556	163	16	graph	graph	NOUN
ajst-30556	163	17	fig.5	fig.5	NOUN
ajst-30556	163	18	shows	show	VERB
ajst-30556	163	19	that	that	SCONJ
ajst-30556	163	20	the	the	DET
ajst-30556	163	21	hfda	hfda	ADJ
ajst-30556	163	22	algorithm	algorithm	NOUN
ajst-30556	163	23	demonstrates	demonstrate	VERB
ajst-30556	163	24	superior	superior	ADJ
ajst-30556	163	25	performance	performance	NOUN
ajst-30556	163	26	compared	compare	VERB
ajst-30556	163	27	to	to	ADP
ajst-30556	163	28	other	other	ADJ
ajst-30556	163	29	algorithms	algorithm	NOUN
ajst-30556	163	30	when	when	SCONJ
ajst-30556	163	31	solving	solve	VERB
ajst-30556	163	32	problems	problem	NOUN
ajst-30556	163	33	with	with	ADP
ajst-30556	163	34	a	a	DET
ajst-30556	163	35	high	high	ADJ
ajst-30556	163	36	degree	degree	NOUN
ajst-30556	163	37	of	of	ADP
ajst-30556	163	38	topological	topological	ADJ
ajst-30556	163	39	complexity	complexity	NOUN
ajst-30556	163	40	.	.	PUNCT
ajst-30556	164	1	compared	compare	VERB
ajst-30556	164	2	with	with	ADP
ajst-30556	164	3	the	the	DET
ajst-30556	164	4	benchmark	benchmark	ADJ
ajst-30556	164	5	algorithms	algorithm	NOUN
ajst-30556	164	6	,	,	PUNCT
ajst-30556	164	7	the	the	DET
ajst-30556	164	8	hfda	hfda	ADJ
ajst-30556	164	9	algorithm	algorithm	NOUN
ajst-30556	164	10	,	,	PUNCT
ajst-30556	164	11	which	which	PRON
ajst-30556	164	12	utilizes	utilize	VERB
ajst-30556	164	13	historical	historical	ADJ
ajst-30556	164	14	local	local	ADJ
ajst-30556	164	15	solution	solution	NOUN
ajst-30556	164	16	information	information	NOUN
ajst-30556	164	17	,	,	PUNCT
ajst-30556	164	18	performs	perform	VERB
ajst-30556	164	19	better	well	ADV
ajst-30556	164	20	.	.	PUNCT
ajst-30556	165	1	in	in	ADP
ajst-30556	165	2	scale	scale	NOUN
ajst-30556	165	3	-	-	PUNCT
ajst-30556	165	4	free	free	ADJ
ajst-30556	165	5	networks	network	NOUN
ajst-30556	165	6	,	,	PUNCT
ajst-30556	165	7	most	most	ADJ
ajst-30556	165	8	nodes	node	NOUN
ajst-30556	165	9	have	have	VERB
ajst-30556	165	10	few	few	ADJ
ajst-30556	165	11	connections	connection	NOUN
ajst-30556	165	12	,	,	PUNCT
ajst-30556	165	13	while	while	SCONJ
ajst-30556	165	14	a	a	DET
ajst-30556	165	15	few	few	ADJ
ajst-30556	165	16	nodes	node	NOUN
ajst-30556	165	17	have	have	VERB
ajst-30556	165	18	extremely	extremely	ADV
ajst-30556	165	19	high	high	ADJ
ajst-30556	165	20	connectivity	connectivity	NOUN
ajst-30556	165	21	.	.	PUNCT
ajst-30556	166	1	this	this	DET
ajst-30556	166	2	distribution	distribution	NOUN
ajst-30556	166	3	characteristic	characteristic	NOUN
ajst-30556	166	4	makes	make	VERB
ajst-30556	166	5	scale	scale	NOUN
ajst-30556	166	6	-	-	PUNCT
ajst-30556	166	7	free	free	ADJ
ajst-30556	166	8	networks	network	NOUN
ajst-30556	166	9	highly	highly	ADV
ajst-30556	166	10	resistant	resistant	ADJ
ajst-30556	166	11	to	to	ADP
ajst-30556	166	12	random	random	ADJ
ajst-30556	166	13	disturbances	disturbance	NOUN
ajst-30556	166	14	but	but	CCONJ
ajst-30556	166	15	vulnerable	vulnerable	ADJ
ajst-30556	166	16	to	to	ADP
ajst-30556	166	17	targeted	target	VERB
ajst-30556	166	18	attacks	attack	NOUN
ajst-30556	166	19	.	.	PUNCT
ajst-30556	167	1	hfda	hfda	PROPN
ajst-30556	167	2	can	can	AUX
ajst-30556	167	3	significantly	significantly	ADV
ajst-30556	167	4	enhance	enhance	VERB
ajst-30556	167	5	local	local	ADJ
ajst-30556	167	6	search	search	NOUN
ajst-30556	167	7	capabilities	capability	NOUN
ajst-30556	167	8	for	for	ADP
ajst-30556	167	9	solving	solve	VERB
ajst-30556	167	10	structured	structured	ADJ
ajst-30556	167	11	problems	problem	NOUN
ajst-30556	167	12	.	.	PUNCT
ajst-30556	168	1	4.2	4.2	NUM
ajst-30556	168	2	.	.	PUNCT
ajst-30556	169	1	the	the	DET
ajst-30556	169	2	friedman	friedman	PROPN
ajst-30556	169	3	test	test	NOUN
ajst-30556	169	4	to	to	PART
ajst-30556	169	5	provide	provide	VERB
ajst-30556	169	6	a	a	DET
ajst-30556	169	7	more	more	ADV
ajst-30556	169	8	intuitive	intuitive	ADJ
ajst-30556	169	9	comparison	comparison	NOUN
ajst-30556	169	10	of	of	ADP
ajst-30556	169	11	hdfa	hdfa	NOUN
ajst-30556	169	12	's	's	PART
ajst-30556	169	13	effectiveness	effectiveness	NOUN
ajst-30556	169	14	,	,	PUNCT
ajst-30556	169	15	table	table	NOUN
ajst-30556	169	16	2	2	NUM
ajst-30556	169	17	presents	present	VERB
ajst-30556	169	18	the	the	DET
ajst-30556	169	19	pairwise	pairwise	NOUN
ajst-30556	169	20	friedman	friedman	NOUN
ajst-30556	169	21	test	test	NOUN
ajst-30556	169	22	results	result	NOUN
ajst-30556	169	23	of	of	ADP
ajst-30556	169	24	hdfa	hdfa	NOUN
ajst-30556	169	25	compared	compare	VERB
ajst-30556	169	26	to	to	ADP
ajst-30556	169	27	other	other	ADJ
ajst-30556	169	28	algorithms	algorithm	NOUN
ajst-30556	169	29	.	.	PUNCT
ajst-30556	170	1	①	①	PROPN
ajst-30556	170	2	represents	represent	VERB
ajst-30556	170	3	the	the	DET
ajst-30556	170	4	problem	problem	NOUN
ajst-30556	170	5	type	type	NOUN
ajst-30556	170	6	as	as	ADP
ajst-30556	170	7	a	a	DET
ajst-30556	170	8	random	random	ADJ
ajst-30556	170	9	dense	dense	ADJ
ajst-30556	170	10	graph	graph	NOUN
ajst-30556	170	11	.	.	PUNCT
ajst-30556	171	1	②	②	NUM
ajst-30556	171	2	represents	represent	VERB
ajst-30556	171	3	the	the	DET
ajst-30556	171	4	problem	problem	NOUN
ajst-30556	171	5	type	type	NOUN
ajst-30556	171	6	as	as	ADP
ajst-30556	171	7	a	a	DET
ajst-30556	171	8	scall	scall	ADJ
ajst-30556	171	9	free	free	ADJ
ajst-30556	171	10	network	network	NOUN
ajst-30556	171	11	.	.	PUNCT
ajst-30556	172	1	2	2	NUM
ajst-30556	172	2	(	(	PUNCT
ajst-30556	172	3	)	)	PUNCT
ajst-30556	172	4	a	a	PRON
ajst-30556	172	5	represents	represent	VERB
ajst-30556	172	6	the	the	DET
ajst-30556	172	7	results	result	NOUN
ajst-30556	172	8	of	of	ADP
ajst-30556	172	9	the	the	DET
ajst-30556	172	10	standard	standard	ADJ
ajst-30556	172	11	statistical	statistical	ADJ
ajst-30556	172	12	test	test	NOUN
ajst-30556	172	13	,	,	PUNCT
ajst-30556	172	14	the	the	DET
ajst-30556	172	15	rank	rank	NOUN
ajst-30556	172	16	test	test	NOUN
ajst-30556	172	17	,	,	PUNCT
ajst-30556	172	18	in	in	ADP
ajst-30556	172	19	pairwise	pairwise	NOUN
ajst-30556	172	20	comparison	comparison	NOUN
ajst-30556	172	21	experiments	experiment	NOUN
ajst-30556	172	22	.	.	PUNCT
ajst-30556	173	1	(	(	PUNCT
ajst-30556	173	2	)	)	PUNCT
ajst-30556	173	3	p	p	NOUN
ajst-30556	173	4	a	a	PRON
ajst-30556	173	5	represents	represent	VERB
ajst-30556	173	6	the	the	DET
ajst-30556	173	7	statistical	statistical	ADJ
ajst-30556	173	8	significance	significance	NOUN
ajst-30556	173	9	level	level	NOUN
ajst-30556	173	10	of	of	ADP
ajst-30556	173	11	the	the	DET
ajst-30556	173	12	pairwise	pairwise	NOUN
ajst-30556	173	13	comparison	comparison	NOUN
ajst-30556	173	14	of	of	ADP
ajst-30556	173	15	algorithms	algorithm	NOUN
ajst-30556	173	16	.	.	PUNCT
ajst-30556	174	1	table	table	NOUN
ajst-30556	174	2	1	1	NUM
ajst-30556	174	3	.	.	PUNCT
ajst-30556	175	1	the	the	DET
ajst-30556	175	2	friedman	friedman	PROPN
ajst-30556	175	3	test	test	NOUN
ajst-30556	175	4	on	on	ADP
ajst-30556	175	5	three	three	NUM
ajst-30556	175	6	benchmark	benchmark	NOUN
ajst-30556	175	7	problems	problem	NOUN
ajst-30556	175	8	problems	problem	VERB
ajst-30556	175	9	hdfa	hdfa	PROPN
ajst-30556	175	10	amcga	amcga	PROPN
ajst-30556	175	11	pfdld	pfdld	PROPN
ajst-30556	175	12	pfd	pfd	PROPN
ajst-30556	175	13	ccocoa	ccocoa	PROPN
ajst-30556	175	14	①	①	PROPN
ajst-30556	175	15	1	1	NUM
ajst-30556	175	16	2	2	NUM
ajst-30556	175	17	3.5	3.5	NUM
ajst-30556	175	18	3.5	3.5	NUM
ajst-30556	175	19	5	5	NUM
ajst-30556	175	20	2	2	NUM
ajst-30556	175	21	(	(	PUNCT
ajst-30556	175	22	)	)	PUNCT
ajst-30556	175	23	a	a	DET
ajst-30556	175	24	\	\	PROPN
ajst-30556	175	25	0.917	0.917	NUM
ajst-30556	175	26	2.49	2.49	NUM
ajst-30556	175	27	3.97	3.97	NUM
ajst-30556	175	28	3.624	3.624	NUM
ajst-30556	175	29	(	(	PUNCT
ajst-30556	175	30	)	)	PUNCT
ajst-30556	175	31	p	p	NOUN
ajst-30556	175	32	a	a	DET
ajst-30556	175	33	\	\	NOUN
ajst-30556	175	34	0.174	0.174	NUM
ajst-30556	175	35	0.04	0.04	NUM
ajst-30556	175	36	0	0	NUM
ajst-30556	175	37	0	0	NUM
ajst-30556	175	38	②	②	NUM
ajst-30556	175	39	1	1	NUM
ajst-30556	175	40	2	2	NUM
ajst-30556	175	41	3.82	3.82	NUM
ajst-30556	175	42	5	5	NUM
ajst-30556	175	43	5.8	5.8	NUM
ajst-30556	175	44	2	2	NUM
ajst-30556	175	45	(	(	PUNCT
ajst-30556	175	46	)	)	PUNCT
ajst-30556	175	47	a	a	DET
ajst-30556	175	48	\	\	NOUN
ajst-30556	175	49	0.881	0.881	NUM
ajst-30556	175	50	2.426	2.426	NUM
ajst-30556	175	51	3.64	3.64	NUM
ajst-30556	175	52	4.821	4.821	NUM
ajst-30556	175	53	(	(	PUNCT
ajst-30556	175	54	)	)	PUNCT
ajst-30556	175	55	p	p	NOUN
ajst-30556	175	56	a	a	DET
ajst-30556	175	57	\	\	PROPN
ajst-30556	175	58	0.215	0.215	NUM
ajst-30556	175	59	0.005	0.005	NUM
ajst-30556	175	60	0	0	NUM
ajst-30556	175	61	0	0	NUM
ajst-30556	175	62	the	the	DET
ajst-30556	175	63	rank	rank	NOUN
ajst-30556	175	64	and	and	CCONJ
ajst-30556	175	65	ranking	ranking	NOUN
ajst-30556	175	66	of	of	ADP
ajst-30556	175	67	hdfa	hdfa	NOUN
ajst-30556	175	68	relative	relative	ADJ
ajst-30556	175	69	to	to	ADP
ajst-30556	175	70	amcga	amcga	PROPN
ajst-30556	175	71	are	be	AUX
ajst-30556	175	72	not	not	PART
ajst-30556	175	73	significantly	significantly	ADV
ajst-30556	175	74	different	different	ADJ
ajst-30556	175	75	from	from	ADP
ajst-30556	175	76	other	other	ADJ
ajst-30556	175	77	algorithms	algorithm	NOUN
ajst-30556	175	78	.	.	PUNCT
ajst-30556	176	1	this	this	PRON
ajst-30556	176	2	is	be	AUX
ajst-30556	176	3	because	because	SCONJ
ajst-30556	176	4	hdfa	hdfa	PROPN
ajst-30556	176	5	is	be	AUX
ajst-30556	176	6	a	a	DET
ajst-30556	176	7	phase	phase	NOUN
ajst-30556	176	8	-	-	PUNCT
ajst-30556	176	9	based	base	VERB
ajst-30556	176	10	algorithm	algorithm	NOUN
ajst-30556	176	11	that	that	PRON
ajst-30556	176	12	starts	start	VERB
ajst-30556	176	13	with	with	ADP
ajst-30556	176	14	a	a	DET
ajst-30556	176	15	local	local	ADJ
ajst-30556	176	16	optimum	optimum	ADJ
ajst-30556	176	17	stage	stage	NOUN
ajst-30556	176	18	as	as	ADP
ajst-30556	176	19	its	its	PRON
ajst-30556	176	20	optimization	optimization	NOUN
ajst-30556	176	21	cycle	cycle	NOUN
ajst-30556	176	22	,	,	PUNCT
ajst-30556	176	23	rather	rather	ADV
ajst-30556	176	24	than	than	ADP
ajst-30556	176	25	being	be	AUX
ajst-30556	176	26	an	an	DET
ajst-30556	176	27	iterative	iterative	ADJ
ajst-30556	176	28	optimization	optimization	NOUN
ajst-30556	176	29	algorithm	algorithm	NOUN
ajst-30556	176	30	like	like	ADP
ajst-30556	176	31	others	other	NOUN
ajst-30556	176	32	.	.	PUNCT
ajst-30556	177	1	hdfa	hdfa	PROPN
ajst-30556	177	2	shows	show	VERB
ajst-30556	177	3	good	good	ADJ
ajst-30556	177	4	performance	performance	NOUN
ajst-30556	177	5	in	in	ADP
ajst-30556	177	6	average	average	ADJ
ajst-30556	177	7	rankings	ranking	NOUN
ajst-30556	177	8	across	across	ADP
ajst-30556	177	9	five	five	NUM
ajst-30556	177	10	problem	problem	NOUN
ajst-30556	177	11	sizes	size	NOUN
ajst-30556	177	12	compared	compare	VERB
ajst-30556	177	13	to	to	ADP
ajst-30556	177	14	other	other	ADJ
ajst-30556	177	15	algorithms	algorithm	NOUN
ajst-30556	177	16	,	,	PUNCT
ajst-30556	177	17	indicating	indicate	VERB
ajst-30556	177	18	that	that	SCONJ
ajst-30556	177	19	it	it	PRON
ajst-30556	177	20	achieves	achieve	VERB
ajst-30556	177	21	results	result	NOUN
ajst-30556	177	22	surpassing	surpass	VERB
ajst-30556	177	23	iterative	iterative	NOUN
ajst-30556	177	24	optimization	optimization	NOUN
ajst-30556	177	25	algorithms	algorithm	NOUN
ajst-30556	177	26	through	through	ADP
ajst-30556	177	27	phase	phase	NOUN
ajst-30556	177	28	-	-	PUNCT
ajst-30556	177	29	based	base	VERB
ajst-30556	177	30	optimization	optimization	NOUN
ajst-30556	177	31	.	.	PUNCT
ajst-30556	178	1	furthermore	furthermore	ADV
ajst-30556	178	2	,	,	PUNCT
ajst-30556	178	3	the	the	DET
ajst-30556	178	4	friedman	friedman	PROPN
ajst-30556	178	5	statistical	statistical	ADJ
ajst-30556	178	6	results	result	NOUN
ajst-30556	178	7	show	show	VERB
ajst-30556	178	8	that	that	SCONJ
ajst-30556	178	9	all	all	DET
ajst-30556	178	10	p	p	NOUN
ajst-30556	178	11	-	-	PUNCT
ajst-30556	178	12	values	value	NOUN
ajst-30556	178	13	are	be	AUX
ajst-30556	178	14	less	less	ADJ
ajst-30556	178	15	than	than	ADP
ajst-30556	178	16	0.05	0.05	NUM
ajst-30556	178	17	,	,	PUNCT
ajst-30556	178	18	indicating	indicate	VERB
ajst-30556	178	19	statistical	statistical	ADJ
ajst-30556	178	20	significance	significance	NOUN
ajst-30556	178	21	between	between	ADP
ajst-30556	178	22	hdfa	hdfa	PROPN
ajst-30556	178	23	and	and	CCONJ
ajst-30556	178	24	the	the	DET
ajst-30556	178	25	four	four	NUM
ajst-30556	178	26	comparison	comparison	NOUN
ajst-30556	178	27	algorithms	algorithm	NOUN
ajst-30556	178	28	,	,	PUNCT
ajst-30556	178	29	which	which	PRON
ajst-30556	178	30	suggests	suggest	VERB
ajst-30556	178	31	that	that	SCONJ
ajst-30556	178	32	hdfa	hdfa	PROPN
ajst-30556	178	33	performs	perform	VERB
ajst-30556	178	34	well	well	ADV
ajst-30556	178	35	across	across	ADP
ajst-30556	178	36	various	various	ADJ
ajst-30556	178	37	problem	problem	NOUN
ajst-30556	178	38	contexts	contexts	NOUN
ajst-30556	178	39	in	in	ADP
ajst-30556	178	40	general	general	ADJ
ajst-30556	178	41	.	.	PUNCT
ajst-30556	179	1	at	at	ADP
ajst-30556	179	2	the	the	DET
ajst-30556	179	3	end	end	NOUN
ajst-30556	179	4	of	of	ADP
ajst-30556	179	5	the	the	DET
ajst-30556	179	6	experiment	experiment	NOUN
ajst-30556	179	7	,	,	PUNCT
ajst-30556	179	8	the	the	DET
ajst-30556	179	9	improvement	improvement	NOUN
ajst-30556	179	10	rate	rate	NOUN
ajst-30556	179	11	of	of	ADP
ajst-30556	179	12	hdfa	hdfa	NOUN
ajst-30556	179	13	compared	compare	VERB
ajst-30556	179	14	to	to	ADP
ajst-30556	179	15	other	other	ADJ
ajst-30556	179	16	algorithms	algorithm	NOUN
ajst-30556	179	17	is	be	AUX
ajst-30556	179	18	presented	present	VERB
ajst-30556	179	19	:	:	PUNCT
ajst-30556	179	20	table	table	NOUN
ajst-30556	179	21	2	2	NUM
ajst-30556	179	22	.	.	PUNCT
ajst-30556	180	1	the	the	DET
ajst-30556	180	2	improvement	improvement	NOUN
ajst-30556	180	3	rate	rate	NOUN
ajst-30556	180	4	of	of	ADP
ajst-30556	180	5	hdfa	hdfa	NOUN
ajst-30556	180	6	compared	compare	VERB
ajst-30556	180	7	to	to	ADP
ajst-30556	180	8	other	other	ADJ
ajst-30556	180	9	algorithms	algorithm	NOUN
ajst-30556	180	10	benchmark	benchmark	NOUN
ajst-30556	180	11	problems	problem	NOUN
ajst-30556	180	12	pfd	pfd	VERB
ajst-30556	180	13	pfdld	pfdld	PROPN
ajst-30556	180	14	amcga	amcga	PROPN
ajst-30556	180	15	c	c	PROPN
ajst-30556	180	16	-	-	PUNCT
ajst-30556	180	17	cocoa	cocoa	NOUN
ajst-30556	180	18	random	random	ADJ
ajst-30556	180	19	sparse	sparse	ADJ
ajst-30556	180	20	graph	graph	NOUN
ajst-30556	180	21	31.60	31.60	NUM
ajst-30556	180	22	%	%	NOUN
ajst-30556	180	23	8.06	8.06	NUM
ajst-30556	180	24	%	%	NOUN
ajst-30556	180	25	2.19	2.19	NUM
ajst-30556	180	26	%	%	NOUN
ajst-30556	180	27	20.98	20.98	NUM
ajst-30556	180	28	%	%	NOUN
ajst-30556	180	29	random	random	ADJ
ajst-30556	180	30	dense	dense	ADJ
ajst-30556	180	31	graph	graph	NOUN
ajst-30556	180	32	32.44	32.44	NUM
ajst-30556	180	33	%	%	NOUN
ajst-30556	180	34	8.32	8.32	NUM
ajst-30556	180	35	%	%	NOUN
ajst-30556	180	36	2.34	2.34	NUM
ajst-30556	180	37	%	%	NOUN
ajst-30556	180	38	40.25	40.25	NUM
ajst-30556	180	39	%	%	NOUN
ajst-30556	180	40	scale	scale	NOUN
ajst-30556	180	41	free	free	ADJ
ajst-30556	180	42	networks	network	NOUN
ajst-30556	180	43	32.18	32.18	NUM
ajst-30556	180	44	%	%	NOUN
ajst-30556	180	45	8.48	8.48	NUM
ajst-30556	180	46	%	%	NOUN
ajst-30556	180	47	3.16	3.16	NUM
ajst-30556	180	48	%	%	NOUN
ajst-30556	180	49	29.35	29.35	NUM
ajst-30556	180	50	%	%	NOUN
ajst-30556	180	51	the	the	DET
ajst-30556	180	52	experimental	experimental	ADJ
ajst-30556	180	53	results	result	NOUN
ajst-30556	180	54	show	show	VERB
ajst-30556	180	55	that	that	SCONJ
ajst-30556	180	56	hdfa	hdfa	PROPN
ajst-30556	180	57	outperforms	outperform	VERB
ajst-30556	180	58	other	other	ADJ
ajst-30556	180	59	algorithms	algorithm	NOUN
ajst-30556	180	60	across	across	ADP
ajst-30556	180	61	different	different	ADJ
ajst-30556	180	62	problem	problem	NOUN
ajst-30556	180	63	types	type	NOUN
ajst-30556	180	64	.	.	PUNCT
ajst-30556	181	1	in	in	ADP
ajst-30556	181	2	random	random	ADJ
ajst-30556	181	3	sparse	sparse	ADJ
ajst-30556	181	4	graphs	graph	NOUN
ajst-30556	181	5	,	,	PUNCT
ajst-30556	181	6	hdfa	hdfa	PROPN
ajst-30556	181	7	achieves	achieve	VERB
ajst-30556	181	8	a	a	DET
ajst-30556	181	9	31.60	31.60	NUM
ajst-30556	181	10	%	%	NOUN
ajst-30556	181	11	improvement	improvement	NOUN
ajst-30556	181	12	over	over	ADP
ajst-30556	181	13	pfd	pfd	PROPN
ajst-30556	181	14	,	,	PUNCT
ajst-30556	181	15	significantly	significantly	ADV
ajst-30556	181	16	surpassing	surpass	VERB
ajst-30556	181	17	pfd	pfd	PROPN
ajst-30556	181	18	-	-	PUNCT
ajst-30556	181	19	ld	ld	PROPN
ajst-30556	181	20	(	(	PUNCT
ajst-30556	181	21	8.06	8.06	NUM
ajst-30556	181	22	%	%	NOUN
ajst-30556	181	23	)	)	PUNCT
ajst-30556	181	24	,	,	PUNCT
ajst-30556	181	25	amcga	amcga	PROPN
ajst-30556	181	26	(	(	PUNCT
ajst-30556	181	27	2.19	2.19	NUM
ajst-30556	181	28	%	%	NOUN
ajst-30556	181	29	)	)	PUNCT
ajst-30556	181	30	,	,	PUNCT
ajst-30556	181	31	and	and	CCONJ
ajst-30556	181	32	c	c	X
ajst-30556	181	33	-	-	PUNCT
ajst-30556	181	34	cocoa	cocoa	NOUN
ajst-30556	181	35	(	(	PUNCT
ajst-30556	181	36	20.98	20.98	NUM
ajst-30556	181	37	%	%	NOUN
ajst-30556	181	38	)	)	PUNCT
ajst-30556	181	39	,	,	PUNCT
ajst-30556	181	40	demonstrating	demonstrate	VERB
ajst-30556	181	41	its	its	PRON
ajst-30556	181	42	effectiveness	effectiveness	NOUN
ajst-30556	181	43	in	in	ADP
ajst-30556	181	44	low	low	ADJ
ajst-30556	181	45	-	-	PUNCT
ajst-30556	181	46	connectivity	connectivity	NOUN
ajst-30556	181	47	environments	environment	NOUN
ajst-30556	181	48	.	.	PUNCT
ajst-30556	182	1	in	in	ADP
ajst-30556	182	2	random	random	ADJ
ajst-30556	182	3	dense	dense	ADJ
ajst-30556	182	4	graphs	graph	NOUN
ajst-30556	182	5	,	,	PUNCT
ajst-30556	182	6	hdfa	hdfa	NOUN
ajst-30556	182	7	surpasses	surpasse	NOUN
ajst-30556	182	8	pfd	pfd	VERB
ajst-30556	182	9	by	by	ADP
ajst-30556	182	10	32.44	32.44	NUM
ajst-30556	182	11	%	%	NOUN
ajst-30556	182	12	and	and	CCONJ
ajst-30556	182	13	outperforms	outperform	VERB
ajst-30556	182	14	c	c	NOUN
ajst-30556	182	15	-	-	PUNCT
ajst-30556	182	16	cocoa	cocoa	NOUN
ajst-30556	182	17	(	(	PUNCT
ajst-30556	182	18	40.25	40.25	NUM
ajst-30556	182	19	%	%	NOUN
ajst-30556	182	20	)	)	PUNCT
ajst-30556	182	21	,	,	PUNCT
ajst-30556	182	22	indicating	indicate	VERB
ajst-30556	182	23	its	its	PRON
ajst-30556	182	24	stability	stability	NOUN
ajst-30556	182	25	in	in	ADP
ajst-30556	182	26	high	high	ADJ
ajst-30556	182	27	-	-	PUNCT
ajst-30556	182	28	connectivity	connectivity	NOUN
ajst-30556	182	29	graphs	graph	NOUN
ajst-30556	182	30	.	.	PUNCT
ajst-30556	183	1	in	in	ADP
ajst-30556	183	2	scale	scale	NOUN
ajst-30556	183	3	-	-	PUNCT
ajst-30556	183	4	free	free	ADJ
ajst-30556	183	5	networks	network	NOUN
ajst-30556	183	6	,	,	PUNCT
ajst-30556	183	7	hdfa	hdfa	PROPN
ajst-30556	183	8	shows	show	VERB
ajst-30556	183	9	a	a	DET
ajst-30556	183	10	32.18	32.18	NUM
ajst-30556	183	11	%	%	NOUN
ajst-30556	183	12	improvement	improvement	NOUN
ajst-30556	183	13	over	over	ADP
ajst-30556	183	14	pfd	pfd	PROPN
ajst-30556	183	15	and	and	CCONJ
ajst-30556	183	16	a	a	DET
ajst-30556	183	17	29.35	29.35	NUM
ajst-30556	183	18	%	%	NOUN
ajst-30556	183	19	improvement	improvement	NOUN
ajst-30556	183	20	over	over	ADP
ajst-30556	183	21	c	c	NOUN
ajst-30556	183	22	-	-	NOUN
ajst-30556	183	23	cocoa	cocoa	NOUN
ajst-30556	183	24	,	,	PUNCT
ajst-30556	183	25	proving	prove	VERB
ajst-30556	183	26	its	its	PRON
ajst-30556	183	27	adaptability	adaptability	NOUN
ajst-30556	183	28	in	in	ADP
ajst-30556	183	29	complex	complex	ADJ
ajst-30556	183	30	topological	topological	ADJ
ajst-30556	183	31	structures	structure	NOUN
ajst-30556	183	32	.	.	PUNCT
ajst-30556	184	1	overall	overall	ADV
ajst-30556	184	2	,	,	PUNCT
ajst-30556	184	3	hdfa	hdfa	PROPN
ajst-30556	184	4	performs	perform	VERB
ajst-30556	184	5	particularly	particularly	ADV
ajst-30556	184	6	well	well	ADV
ajst-30556	184	7	in	in	ADP
ajst-30556	184	8	dense	dense	ADJ
ajst-30556	184	9	graphs	graph	NOUN
ajst-30556	184	10	and	and	CCONJ
ajst-30556	184	11	scale	scale	NOUN
ajst-30556	184	12	-	-	PUNCT
ajst-30556	184	13	free	free	ADJ
ajst-30556	184	14	networks	network	NOUN
ajst-30556	184	15	,	,	PUNCT
ajst-30556	184	16	demonstrating	demonstrate	VERB
ajst-30556	184	17	superior	superior	ADJ
ajst-30556	184	18	optimization	optimization	NOUN
ajst-30556	184	19	capabilities	capability	NOUN
ajst-30556	184	20	.	.	PUNCT
ajst-30556	185	1	5	5	X
ajst-30556	185	2	.	.	X
ajst-30556	185	3	conclusion	conclusion	NOUN
ajst-30556	185	4	this	this	DET
ajst-30556	185	5	paper	paper	NOUN
ajst-30556	185	6	provides	provide	VERB
ajst-30556	185	7	a	a	DET
ajst-30556	185	8	detailed	detailed	ADJ
ajst-30556	185	9	analysis	analysis	NOUN
ajst-30556	185	10	of	of	ADP
ajst-30556	185	11	the	the	DET
ajst-30556	185	12	current	current	ADJ
ajst-30556	185	13	research	research	NOUN
ajst-30556	185	14	status	status	NOUN
ajst-30556	185	15	of	of	ADP
ajst-30556	185	16	incomplete	incomplete	ADJ
ajst-30556	185	17	solving	solving	NOUN
ajst-30556	185	18	algorithms	algorithm	NOUN
ajst-30556	185	19	for	for	ADP
ajst-30556	185	20	c	c	NOUN
ajst-30556	185	21	-	-	PUNCT
ajst-30556	185	22	dcop	dcop	NOUN
ajst-30556	185	23	.	.	PUNCT
ajst-30556	186	1	addressing	address	VERB
ajst-30556	186	2	the	the	DET
ajst-30556	186	3	issues	issue	NOUN
ajst-30556	186	4	of	of	ADP
ajst-30556	186	5	existing	exist	VERB
ajst-30556	186	6	algorithms	algorithm	NOUN
ajst-30556	186	7	that	that	PRON
ajst-30556	186	8	often	often	ADV
ajst-30556	186	9	get	get	AUX
ajst-30556	186	10	trapped	trap	VERB
ajst-30556	186	11	in	in	ADP
ajst-30556	186	12	local	local	ADJ
ajst-30556	186	13	optima	optima	NOUN
ajst-30556	186	14	and	and	CCONJ
ajst-30556	186	15	can	can	AUX
ajst-30556	186	16	not	not	PART
ajst-30556	186	17	escape	escape	VERB
ajst-30556	186	18	,	,	PUNCT
ajst-30556	186	19	this	this	DET
ajst-30556	186	20	paper	paper	NOUN
ajst-30556	186	21	proposes	propose	VERB
ajst-30556	186	22	an	an	DET
ajst-30556	186	23	escape	escape	NOUN
ajst-30556	186	24	from	from	ADP
ajst-30556	186	25	local	local	ADJ
ajst-30556	186	26	optima	optima	PROPN
ajst-30556	186	27	algorithm	algorithm	NOUN
ajst-30556	186	28	based	base	VERB
ajst-30556	186	29	on	on	ADP
ajst-30556	186	30	historical	historical	ADJ
ajst-30556	186	31	feature	feature	NOUN
ajst-30556	186	32	distribution	distribution	NOUN
ajst-30556	186	33	for	for	ADP
ajst-30556	186	34	solving	solve	VERB
ajst-30556	186	35	continuous	continuous	ADJ
ajst-30556	186	36	distributed	distribute	VERB
ajst-30556	186	37	constraint	constraint	NOUN
ajst-30556	186	38	optimization	optimization	NOUN
ajst-30556	186	39	problems	problem	NOUN
ajst-30556	186	40	(	(	PUNCT
ajst-30556	186	41	hfda	hfda	ADJ
ajst-30556	186	42	)	)	PUNCT
ajst-30556	186	43	.	.	PUNCT
ajst-30556	187	1	the	the	DET
ajst-30556	187	2	algorithm	algorithm	NOUN
ajst-30556	187	3	caches	cache	VERB
ajst-30556	187	4	the	the	DET
ajst-30556	187	5	agent	agent	NOUN
ajst-30556	187	6	's	's	PART
ajst-30556	187	7	historical	historical	ADJ
ajst-30556	187	8	values	value	NOUN
ajst-30556	187	9	during	during	ADP
ajst-30556	187	10	the	the	DET
ajst-30556	187	11	process	process	NOUN
ajst-30556	187	12	of	of	ADP
ajst-30556	187	13	falling	fall	VERB
ajst-30556	187	14	into	into	ADP
ajst-30556	187	15	local	local	ADJ
ajst-30556	187	16	optima	optima	NOUN
ajst-30556	187	17	,	,	PUNCT
ajst-30556	187	18	and	and	CCONJ
ajst-30556	187	19	after	after	ADP
ajst-30556	187	20	completely	completely	ADV
ajst-30556	187	21	becoming	become	VERB
ajst-30556	187	22	stuck	stick	VERB
ajst-30556	187	23	in	in	ADP
ajst-30556	187	24	a	a	DET
ajst-30556	187	25	local	local	ADJ
ajst-30556	187	26	optimum	optimum	NOUN
ajst-30556	187	27	,	,	PUNCT
ajst-30556	187	28	constructs	construct	VERB
ajst-30556	187	29	the	the	DET
ajst-30556	187	30	stage	stage	NOUN
ajst-30556	187	31	influence	influence	NOUN
ajst-30556	187	32	using	use	VERB
ajst-30556	187	33	the	the	DET
ajst-30556	187	34	historical	historical	ADJ
ajst-30556	187	35	values	value	NOUN
ajst-30556	187	36	and	and	CCONJ
ajst-30556	187	37	the	the	DET
ajst-30556	187	38	integral	integral	ADJ
ajst-30556	187	39	form	form	NOUN
ajst-30556	187	40	of	of	ADP
ajst-30556	187	41	the	the	DET
ajst-30556	187	42	neighbor	neighbor	NOUN
ajst-30556	187	43	’s	’s	PART
ajst-30556	187	44	constraint	constraint	NOUN
ajst-30556	187	45	functions	function	NOUN
ajst-30556	187	46	.	.	PUNCT
ajst-30556	188	1	it	it	PRON
ajst-30556	188	2	then	then	ADV
ajst-30556	188	3	uses	use	VERB
ajst-30556	188	4	a	a	DET
ajst-30556	188	5	probabilistic	probabilistic	ADJ
ajst-30556	188	6	ignoring	ignore	VERB
ajst-30556	188	7	mechanism	mechanism	NOUN
ajst-30556	188	8	to	to	ADP
ajst-30556	188	9	disregard	disregard	NOUN
ajst-30556	188	10	neighbors	neighbor	NOUN
ajst-30556	188	11	,	,	PUNCT
ajst-30556	188	12	helping	help	VERB
ajst-30556	188	13	the	the	DET
ajst-30556	188	14	agent	agent	NOUN
ajst-30556	188	15	escape	escape	VERB
ajst-30556	188	16	from	from	ADP
ajst-30556	188	17	local	local	ADJ
ajst-30556	188	18	optima	optima	NOUN
ajst-30556	188	19	dominated	dominate	VERB
ajst-30556	188	20	by	by	ADP
ajst-30556	188	21	strong	strong	ADJ
ajst-30556	188	22	neighbor	neighbor	NOUN
ajst-30556	188	23	control	control	NOUN
ajst-30556	188	24	.	.	PUNCT
ajst-30556	189	1	this	this	DET
ajst-30556	189	2	approach	approach	NOUN
ajst-30556	189	3	enables	enable	VERB
ajst-30556	189	4	the	the	DET
ajst-30556	189	5	exploration	exploration	NOUN
ajst-30556	189	6	of	of	ADP
ajst-30556	189	7	new	new	ADJ
ajst-30556	189	8	solution	solution	NOUN
ajst-30556	189	9	spaces	space	VERB
ajst-30556	189	10	.	.	PUNCT
ajst-30556	190	1	the	the	DET
ajst-30556	190	2	designed	design	VERB
ajst-30556	190	3	probabilistic	probabilistic	ADJ
ajst-30556	190	4	ignoring	ignore	VERB
ajst-30556	190	5	mechanism	mechanism	NOUN
ajst-30556	190	6	takes	take	VERB
ajst-30556	190	7	into	into	ADP
ajst-30556	190	8	account	account	NOUN
ajst-30556	190	9	the	the	DET
ajst-30556	190	10	strength	strength	NOUN
ajst-30556	190	11	of	of	ADP
ajst-30556	190	12	the	the	DET
ajst-30556	190	13	neighbors	neighbor	NOUN
ajst-30556	190	14	'	'	PART
ajst-30556	190	15	influence	influence	NOUN
ajst-30556	190	16	and	and	CCONJ
ajst-30556	190	17	the	the	DET
ajst-30556	190	18	potential	potential	ADJ
ajst-30556	190	19	noise	noise	NOUN
ajst-30556	190	20	impact	impact	NOUN
ajst-30556	190	21	after	after	ADP
ajst-30556	190	22	ignoring	ignore	VERB
ajst-30556	190	23	,	,	PUNCT
ajst-30556	190	24	expanding	expand	VERB
ajst-30556	190	25	the	the	DET
ajst-30556	190	26	exploration	exploration	NOUN
ajst-30556	190	27	of	of	ADP
ajst-30556	190	28	the	the	DET
ajst-30556	190	29	solution	solution	NOUN
ajst-30556	190	30	space	space	NOUN
ajst-30556	190	31	while	while	SCONJ
ajst-30556	190	32	minimizing	minimize	VERB
ajst-30556	190	33	algorithm	algorithm	NOUN
ajst-30556	190	34	degradation	degradation	NOUN
ajst-30556	190	35	.	.	PUNCT
ajst-30556	191	1	furthermore	furthermore	ADV
ajst-30556	191	2	,	,	PUNCT
ajst-30556	191	3	the	the	DET
ajst-30556	191	4	algorithm	algorithm	NOUN
ajst-30556	191	5	innovatively	innovatively	ADV
ajst-30556	191	6	abandons	abandon	VERB
ajst-30556	191	7	the	the	DET
ajst-30556	191	8	anytime	anytime	ADJ
ajst-30556	191	9	property	property	NOUN
ajst-30556	191	10	during	during	ADP
ajst-30556	191	11	the	the	DET
ajst-30556	191	12	early	early	ADJ
ajst-30556	191	13	iterations	iteration	NOUN
ajst-30556	191	14	,	,	PUNCT
ajst-30556	191	15	allowing	allow	VERB
ajst-30556	191	16	the	the	DET
ajst-30556	191	17	newly	newly	ADV
ajst-30556	191	18	generated	generate	VERB
ajst-30556	191	19	solution	solution	NOUN
ajst-30556	191	20	space	space	NOUN
ajst-30556	191	21	to	to	PART
ajst-30556	191	22	be	be	AUX
ajst-30556	191	23	effectively	effectively	ADV
ajst-30556	191	24	explored	explore	VERB
ajst-30556	191	25	,	,	PUNCT
ajst-30556	191	26	significantly	significantly	ADV
ajst-30556	191	27	liberating	liberate	VERB
ajst-30556	191	28	the	the	DET
ajst-30556	191	29	solution	solution	NOUN
ajst-30556	191	30	development	development	NOUN
ajst-30556	191	31	capability	capability	NOUN
ajst-30556	191	32	of	of	ADP
ajst-30556	191	33	each	each	DET
ajst-30556	191	34	agent	agent	NOUN
ajst-30556	191	35	.	.	PUNCT
ajst-30556	192	1	in	in	ADP
ajst-30556	192	2	the	the	DET
ajst-30556	192	3	theoretical	theoretical	ADJ
ajst-30556	192	4	analysis	analysis	NOUN
ajst-30556	192	5	,	,	PUNCT
ajst-30556	192	6	this	this	DET
ajst-30556	192	7	paper	paper	NOUN
ajst-30556	192	8	analyzes	analyze	VERB
ajst-30556	192	9	the	the	DET
ajst-30556	192	10	complexity	complexity	NOUN
ajst-30556	192	11	of	of	ADP
ajst-30556	192	12	each	each	DET
ajst-30556	192	13	step	step	NOUN
ajst-30556	192	14	and	and	CCONJ
ajst-30556	192	15	focuses	focus	VERB
ajst-30556	192	16	on	on	ADP
ajst-30556	192	17	the	the	DET
ajst-30556	192	18	time	time	NOUN
ajst-30556	192	19	complexity	complexity	NOUN
ajst-30556	192	20	during	during	ADP
ajst-30556	192	21	the	the	DET
ajst-30556	192	22	ignoring	ignore	VERB
ajst-30556	192	23	phase	phase	NOUN
ajst-30556	192	24	.	.	PUNCT
ajst-30556	193	1	comprehensive	comprehensive	ADJ
ajst-30556	193	2	experimental	experimental	ADJ
ajst-30556	193	3	results	result	NOUN
ajst-30556	193	4	show	show	VERB
ajst-30556	193	5	that	that	SCONJ
ajst-30556	193	6	the	the	DET
ajst-30556	193	7	algorithm	algorithm	NOUN
ajst-30556	193	8	achieves	achieve	VERB
ajst-30556	193	9	high	high	ADJ
ajst-30556	193	10	solution	solution	NOUN
ajst-30556	193	11	quality	quality	NOUN
ajst-30556	193	12	across	across	ADP
ajst-30556	193	13	various	various	ADJ
ajst-30556	193	14	problem	problem	NOUN
ajst-30556	193	15	models	model	NOUN
ajst-30556	193	16	,	,	PUNCT
ajst-30556	193	17	particularly	particularly	ADV
ajst-30556	193	18	for	for	ADP
ajst-30556	193	19	large	large	ADJ
ajst-30556	193	20	-	-	PUNCT
ajst-30556	193	21	scale	scale	NOUN
ajst-30556	193	22	and	and	CCONJ
ajst-30556	193	23	high	high	ADJ
ajst-30556	193	24	-	-	PUNCT
ajst-30556	193	25	density	density	NOUN
ajst-30556	193	26	248	248	NUM
ajst-30556	193	27	problems	problem	NOUN
ajst-30556	193	28	.	.	PUNCT
ajst-30556	194	1	in	in	ADP
ajst-30556	194	2	these	these	DET
ajst-30556	194	3	cases	case	NOUN
ajst-30556	194	4	,	,	PUNCT
ajst-30556	194	5	the	the	DET
ajst-30556	194	6	algorithm	algorithm	NOUN
ajst-30556	194	7	leverages	leverage	VERB
ajst-30556	194	8	more	more	ADJ
ajst-30556	194	9	historical	historical	ADJ
ajst-30556	194	10	solution	solution	NOUN
ajst-30556	194	11	information	information	NOUN
ajst-30556	194	12	,	,	PUNCT
ajst-30556	194	13	yielding	yield	VERB
ajst-30556	194	14	better	well	ADJ
ajst-30556	194	15	results	result	NOUN
ajst-30556	194	16	.	.	PUNCT
ajst-30556	195	1	acknowledgements	acknowledgement	NOUN
ajst-30556	195	2	chongqing	chongqe	VERB
ajst-30556	195	3	municipal	municipal	ADJ
ajst-30556	195	4	education	education	PROPN
ajst-30556	195	5	commission	commission	PROPN
ajst-30556	195	6	science	science	NOUN
ajst-30556	195	7	and	and	CCONJ
ajst-30556	195	8	technology	technology	NOUN
ajst-30556	195	9	research	research	NOUN
ajst-30556	195	10	program	program	NOUN
ajst-30556	195	11	youth	youth	NOUN
ajst-30556	195	12	project	project	NOUN
ajst-30556	195	13	(	(	PUNCT
ajst-30556	195	14	no	no	INTJ
ajst-30556	195	15	.	.	PUNCT
ajst-30556	196	1	kjqn202401101	kjqn202401101	PROPN
ajst-30556	196	2	)	)	PUNCT
ajst-30556	196	3	,	,	PUNCT
ajst-30556	196	4	chongqing	chongqing	PROPN
ajst-30556	196	5	university	university	PROPN
ajst-30556	196	6	of	of	ADP
ajst-30556	196	7	technology	technology	NOUN
ajst-30556	196	8	graduate	graduate	NOUN
ajst-30556	196	9	innovation	innovation	NOUN
ajst-30556	196	10	engineering	engineering	NOUN
ajst-30556	196	11	project	project	NOUN
ajst-30556	196	12	(	(	PUNCT
ajst-30556	196	13	gzlcx20233196	gzlcx20233196	PROPN
ajst-30556	196	14	)	)	PUNCT
ajst-30556	196	15	,	,	PUNCT
ajst-30556	196	16	and	and	CCONJ
ajst-30556	196	17	the	the	DET
ajst-30556	196	18	scientific	scientific	ADJ
ajst-30556	196	19	research	research	NOUN
ajst-30556	196	20	foundation	foundation	NOUN
ajst-30556	196	21	of	of	ADP
ajst-30556	196	22	chongqing	chongqing	PROPN
ajst-30556	196	23	university	university	PROPN
ajst-30556	196	24	of	of	ADP
ajst-30556	196	25	technology	technology	NOUN
ajst-30556	196	26	.	.	PUNCT
ajst-30556	197	1	the	the	DET
ajst-30556	197	2	funders	funder	NOUN
ajst-30556	197	3	had	have	VERB
ajst-30556	197	4	no	no	DET
ajst-30556	197	5	role	role	NOUN
ajst-30556	197	6	in	in	ADP
ajst-30556	197	7	study	study	NOUN
ajst-30556	197	8	design	design	NOUN
ajst-30556	197	9	,	,	PUNCT
ajst-30556	197	10	data	datum	NOUN
ajst-30556	197	11	collection	collection	NOUN
ajst-30556	197	12	and	and	CCONJ
ajst-30556	197	13	analysis	analysis	NOUN
ajst-30556	197	14	,	,	PUNCT
ajst-30556	197	15	decision	decision	NOUN
ajst-30556	197	16	to	to	PART
ajst-30556	197	17	publish	publish	VERB
ajst-30556	197	18	,	,	PUNCT
ajst-30556	197	19	or	or	CCONJ
ajst-30556	197	20	preparation	preparation	NOUN
ajst-30556	197	21	of	of	ADP
ajst-30556	197	22	the	the	DET
ajst-30556	197	23	manuscript	manuscript	NOUN
ajst-30556	197	24	.	.	PUNCT
ajst-30556	198	1	references	reference	NOUN
ajst-30556	198	2	[	[	X
ajst-30556	198	3	1	1	NUM
ajst-30556	198	4	]	]	PUNCT
ajst-30556	198	5	pujol	pujol	NOUN
ajst-30556	198	6	g.	g.	PROPN
ajst-30556	198	7	multi	multi	ADJ
ajst-30556	198	8	-	-	ADJ
ajst-30556	198	9	agent	agent	ADJ
ajst-30556	198	10	coordination	coordination	NOUN
ajst-30556	198	11	dcops	dcop	NOUN
ajst-30556	198	12	and	and	CCONJ
ajst-30556	198	13	beyond	beyond	ADP
ajst-30556	198	14	[	[	X
ajst-30556	198	15	j	j	X
ajst-30556	198	16	]	]	X
ajst-30556	198	17	.	.	PUNCT
ajst-30556	199	1	proceedings	proceeding	NOUN
ajst-30556	199	2	international	international	ADJ
ajst-30556	199	3	joint	joint	ADJ
ajst-30556	199	4	conference	conference	NOUN
ajst-30556	199	5	on	on	ADP
ajst-30556	199	6	artificial	artificial	ADJ
ajst-30556	199	7	intelligence	intelligence	NOUN
ajst-30556	199	8	,	,	PUNCT
ajst-30556	199	9	2011	2011	NUM
ajst-30556	199	10	,	,	PUNCT
ajst-30556	199	11	22	22	NUM
ajst-30556	199	12	(	(	PUNCT
ajst-30556	199	13	3	3	NUM
ajst-30556	199	14	):	):	PUNCT
ajst-30556	199	15	28	28	NUM
ajst-30556	199	16	-	-	SYM
ajst-30556	199	17	38	38	NUM
ajst-30556	199	18	.	.	PUNCT
ajst-30556	200	1	[	[	X
ajst-30556	200	2	2	2	NUM
ajst-30556	200	3	]	]	PUNCT
ajst-30556	200	4	leite	leite	PROPN
ajst-30556	200	5	a	a	DET
ajst-30556	200	6	r	r	PROPN
ajst-30556	200	7	,	,	PUNCT
ajst-30556	200	8	enembreck	enembreck	NOUN
ajst-30556	200	9	f	f	PROPN
ajst-30556	200	10	,	,	PUNCT
ajst-30556	200	11	barthes	barthes	PROPN
ajst-30556	200	12	j	j	PROPN
ajst-30556	200	13	p	p	NOUN
ajst-30556	200	14	a.	a.	NOUN
ajst-30556	200	15	distributed	distribute	VERB
ajst-30556	200	16	constraint	constraint	NOUN
ajst-30556	200	17	optimization	optimization	NOUN
ajst-30556	200	18	problems	problem	NOUN
ajst-30556	200	19	:	:	PUNCT
ajst-30556	200	20	review	review	NOUN
ajst-30556	200	21	and	and	CCONJ
ajst-30556	200	22	perspectives[j	perspectives[j	PROPN
ajst-30556	200	23	]	]	PUNCT
ajst-30556	200	24	.	.	PUNCT
ajst-30556	201	1	expert	expert	NOUN
ajst-30556	201	2	systems	system	NOUN
ajst-30556	201	3	with	with	ADP
ajst-30556	201	4	applications	application	NOUN
ajst-30556	201	5	,	,	PUNCT
ajst-30556	201	6	2014	2014	NUM
ajst-30556	201	7	,	,	PUNCT
ajst-30556	201	8	41(11	41(11	NUM
ajst-30556	201	9	):	):	PUNCT
ajst-30556	201	10	5139	5139	NUM
ajst-30556	201	11	-	-	SYM
ajst-30556	201	12	5157	5157	NUM
ajst-30556	201	13	.	.	PUNCT
ajst-30556	202	1	[	[	X
ajst-30556	202	2	3	3	X
ajst-30556	202	3	]	]	X
ajst-30556	202	4	enembreck	enembreck	NOUN
ajst-30556	202	5	f	f	PROPN
ajst-30556	202	6	,	,	PUNCT
ajst-30556	202	7	barthes	barthes	PROPN
ajst-30556	202	8	j	j	PROPN
ajst-30556	202	9	p	p	NOUN
ajst-30556	202	10	a.	a.	NOUN
ajst-30556	202	11	distributed	distribute	VERB
ajst-30556	202	12	constraint	constraint	NOUN
ajst-30556	202	13	optimization	optimization	NOUN
ajst-30556	202	14	with	with	ADP
ajst-30556	202	15	mulbs	mulbs	PROPN
ajst-30556	202	16	:	:	PUNCT
ajst-30556	202	17	a	a	DET
ajst-30556	202	18	case	case	NOUN
ajst-30556	202	19	study	study	NOUN
ajst-30556	202	20	on	on	ADP
ajst-30556	202	21	collaborative	collaborative	ADJ
ajst-30556	202	22	meeting	meeting	NOUN
ajst-30556	202	23	scheduling[j	scheduling[j	PROPN
ajst-30556	202	24	]	]	PUNCT
ajst-30556	202	25	.	.	PUNCT
ajst-30556	203	1	journal	journal	PROPN
ajst-30556	203	2	of	of	ADP
ajst-30556	203	3	network	network	NOUN
ajst-30556	203	4	and	and	CCONJ
ajst-30556	203	5	computer	computer	NOUN
ajst-30556	203	6	applications	application	NOUN
ajst-30556	203	7	,	,	PUNCT
ajst-30556	203	8	2012	2012	NUM
ajst-30556	203	9	,	,	PUNCT
ajst-30556	203	10	35(1	35(1	NUM
ajst-30556	203	11	):	):	PUNCT
ajst-30556	203	12	164	164	NUM
ajst-30556	203	13	-	-	SYM
ajst-30556	203	14	175	175	NUM
ajst-30556	203	15	.	.	PUNCT
ajst-30556	204	1	[	[	X
ajst-30556	204	2	4	4	X
ajst-30556	204	3	]	]	X
ajst-30556	204	4	zhang	zhang	PROPN
ajst-30556	204	5	w	w	PROPN
ajst-30556	204	6	,	,	PUNCT
ajst-30556	204	7	wang	wang	PROPN
ajst-30556	204	8	g	g	PROPN
ajst-30556	204	9	,	,	PUNCT
ajst-30556	204	10	xing	xing	PROPN
ajst-30556	204	11	z	z	PROPN
ajst-30556	204	12	,	,	PUNCT
ajst-30556	204	13	et	et	PROPN
ajst-30556	204	14	al	al	PROPN
ajst-30556	204	15	.	.	PROPN
ajst-30556	204	16	distributed	distribute	VERB
ajst-30556	204	17	stochastic	stochastic	ADJ
ajst-30556	204	18	search	search	NOUN
ajst-30556	204	19	and	and	CCONJ
ajst-30556	204	20	distributed	distributed	ADJ
ajst-30556	204	21	breakout	breakout	NOUN
ajst-30556	204	22	:	:	PUNCT
ajst-30556	204	23	properties	property	NOUN
ajst-30556	204	24	,	,	PUNCT
ajst-30556	204	25	comparison	comparison	NOUN
ajst-30556	204	26	and	and	CCONJ
ajst-30556	204	27	applications	application	NOUN
ajst-30556	204	28	to	to	PART
ajst-30556	204	29	constraint	constraint	VERB
ajst-30556	204	30	optimization	optimization	NOUN
ajst-30556	204	31	problems	problem	NOUN
ajst-30556	204	32	in	in	ADP
ajst-30556	204	33	sensor	sensor	NOUN
ajst-30556	204	34	networks[j	networks[j	PROPN
ajst-30556	204	35	]	]	X
ajst-30556	204	36	.	.	PUNCT
ajst-30556	205	1	artificial	artificial	ADJ
ajst-30556	205	2	intelligence	intelligence	NOUN
ajst-30556	205	3	,	,	PUNCT
ajst-30556	205	4	2005	2005	NUM
ajst-30556	205	5	,	,	PUNCT
ajst-30556	205	6	161(1	161(1	NUM
ajst-30556	205	7	-	-	SYM
ajst-30556	205	8	2	2	NUM
ajst-30556	205	9	):	):	PUNCT
ajst-30556	205	10	55	55	NUM
ajst-30556	205	11	-	-	SYM
ajst-30556	205	12	87	87	NUM
ajst-30556	205	13	.	.	PUNCT
ajst-30556	206	1	[	[	X
ajst-30556	206	2	5	5	NUM
ajst-30556	206	3	]	]	X
ajst-30556	206	4	lesser	less	ADJ
ajst-30556	206	5	v	v	NOUN
ajst-30556	206	6	,	,	PUNCT
ajst-30556	206	7	ortiz	ortiz	PROPN
ajst-30556	206	8	jr	jr	PROPN
ajst-30556	206	9	c	c	PROPN
ajst-30556	206	10	l	l	PROPN
ajst-30556	206	11	,	,	PUNCT
ajst-30556	206	12	tambe	tambe	ADP
ajst-30556	206	13	m.	m.	NOUN
ajst-30556	206	14	distributed	distribute	VERB
ajst-30556	206	15	sensor	sensor	NOUN
ajst-30556	206	16	networks	network	NOUN
ajst-30556	206	17	:	:	PUNCT
ajst-30556	206	18	introduction	introduction	NOUN
ajst-30556	206	19	to	to	ADP
ajst-30556	206	20	a	a	DET
ajst-30556	206	21	multiagent	multiagent	NOUN
ajst-30556	206	22	perspective[m]//distributed	perspective[m]//distribute	VERB
ajst-30556	206	23	sensor	sensor	NOUN
ajst-30556	206	24	networks	network	NOUN
ajst-30556	206	25	:	:	PUNCT
ajst-30556	206	26	a	a	DET
ajst-30556	206	27	multiagent	multiagent	NOUN
ajst-30556	206	28	perspective	perspective	NOUN
ajst-30556	206	29	.	.	PUNCT
ajst-30556	207	1	boston	boston	PROPN
ajst-30556	207	2	,	,	PUNCT
ajst-30556	207	3	ma	ma	PROPN
ajst-30556	207	4	:	:	PUNCT
ajst-30556	207	5	springer	springer	NOUN
ajst-30556	207	6	us	we	PRON
ajst-30556	207	7	,	,	PUNCT
ajst-30556	207	8	2003	2003	NUM
ajst-30556	207	9	:	:	PUNCT
ajst-30556	207	10	1	1	NUM
ajst-30556	207	11	-	-	SYM
ajst-30556	207	12	8	8	NUM
ajst-30556	207	13	.	.	PUNCT
ajst-30556	208	1	[	[	X
ajst-30556	208	2	6	6	NUM
ajst-30556	208	3	]	]	PUNCT
ajst-30556	208	4	stranders	strander	NOUN
ajst-30556	208	5	r	r	NOUN
ajst-30556	208	6	,	,	PUNCT
ajst-30556	208	7	farinelli	farinelli	NOUN
ajst-30556	208	8	a	a	PRON
ajst-30556	208	9	,	,	PUNCT
ajst-30556	208	10	rogers	rogers	PROPN
ajst-30556	208	11	a	a	X
ajst-30556	208	12	,	,	PUNCT
ajst-30556	208	13	et	et	PROPN
ajst-30556	208	14	al	al	PROPN
ajst-30556	208	15	.	.	PROPN
ajst-30556	208	16	decentralised	decentralise	VERB
ajst-30556	208	17	control	control	NOUN
ajst-30556	208	18	of	of	ADP
ajst-30556	208	19	continuously	continuously	ADV
ajst-30556	208	20	valued	value	VERB
ajst-30556	208	21	control	control	NOUN
ajst-30556	208	22	parameters	parameter	NOUN
ajst-30556	208	23	using	use	VERB
ajst-30556	208	24	the	the	DET
ajst-30556	208	25	max	max	PROPN
ajst-30556	208	26	-	-	PUNCT
ajst-30556	208	27	sum	sum	NOUN
ajst-30556	208	28	algorithm[j	algorithm[j	PROPN
ajst-30556	208	29	]	]	PUNCT
ajst-30556	208	30	.	.	PUNCT
ajst-30556	208	31	2009	2009	NUM
ajst-30556	208	32	.	.	PUNCT
ajst-30556	209	1	[	[	X
ajst-30556	209	2	7	7	X
ajst-30556	209	3	]	]	X
ajst-30556	209	4	farinelli	farinelli	NOUN
ajst-30556	209	5	a	a	PROPN
ajst-30556	209	6	,	,	PUNCT
ajst-30556	209	7	rogers	rogers	PROPN
ajst-30556	209	8	a	a	PRON
ajst-30556	209	9	,	,	PUNCT
ajst-30556	209	10	petcu	petcu	ADJ
ajst-30556	209	11	a	a	X
ajst-30556	209	12	,	,	PUNCT
ajst-30556	209	13	et	et	PROPN
ajst-30556	209	14	al	al	PROPN
ajst-30556	209	15	.	.	PROPN
ajst-30556	209	16	decentralised	decentralise	VERB
ajst-30556	209	17	coordination	coordination	NOUN
ajst-30556	209	18	of	of	ADP
ajst-30556	209	19	low	low	ADJ
ajst-30556	209	20	-	-	PUNCT
ajst-30556	209	21	power	power	NOUN
ajst-30556	209	22	embedded	embed	VERB
ajst-30556	209	23	devices	device	NOUN
ajst-30556	209	24	using	use	VERB
ajst-30556	209	25	the	the	DET
ajst-30556	209	26	maxsum	maxsum	NOUN
ajst-30556	209	27	algorithm[j	algorithm[j	PROPN
ajst-30556	209	28	]	]	PUNCT
ajst-30556	209	29	.	.	PUNCT
ajst-30556	209	30	2008	2008	NUM
ajst-30556	209	31	.	.	PUNCT
ajst-30556	210	1	[	[	X
ajst-30556	210	2	8	8	NUM
ajst-30556	210	3	]	]	X
ajst-30556	210	4	voice	voice	NOUN
ajst-30556	210	5	t	t	PROPN
ajst-30556	210	6	,	,	PUNCT
ajst-30556	210	7	stranders	strander	NOUN
ajst-30556	210	8	r	r	PROPN
ajst-30556	210	9	,	,	PUNCT
ajst-30556	210	10	rogers	rogers	PROPN
ajst-30556	210	11	a	a	X
ajst-30556	210	12	,	,	PUNCT
ajst-30556	210	13	et	et	PROPN
ajst-30556	210	14	al	al	PROPN
ajst-30556	210	15	.	.	PUNCT
ajst-30556	211	1	a	a	DET
ajst-30556	211	2	hybrid	hybrid	ADJ
ajst-30556	211	3	continuous	continuous	ADJ
ajst-30556	211	4	max	max	ADJ
ajst-30556	211	5	-	-	PUNCT
ajst-30556	211	6	sum	sum	NOUN
ajst-30556	211	7	algorithm	algorithm	NOUN
ajst-30556	211	8	for	for	ADP
ajst-30556	211	9	decentralised	decentralise	VERB
ajst-30556	211	10	coordination[m]//ecai	coordination[m]//ecai	PROPN
ajst-30556	211	11	2010	2010	NUM
ajst-30556	211	12	.	.	PUNCT
ajst-30556	212	1	ios	ios	PROPN
ajst-30556	212	2	press	press	NOUN
ajst-30556	212	3	,	,	PUNCT
ajst-30556	212	4	2010	2010	NUM
ajst-30556	212	5	:	:	PUNCT
ajst-30556	212	6	61	61	NUM
ajst-30556	212	7	-	-	SYM
ajst-30556	212	8	66	66	NUM
ajst-30556	212	9	.	.	PUNCT
ajst-30556	213	1	[	[	X
ajst-30556	213	2	9	9	NUM
ajst-30556	213	3	]	]	X
ajst-30556	213	4	hoang	hoang	PROPN
ajst-30556	213	5	k	k	PROPN
ajst-30556	213	6	d	d	PROPN
ajst-30556	213	7	,	,	PUNCT
ajst-30556	213	8	yeoh	yeoh	PROPN
ajst-30556	213	9	w	w	PROPN
ajst-30556	213	10	,	,	PUNCT
ajst-30556	213	11	yokoo	yokoo	PROPN
ajst-30556	213	12	m	m	PROPN
ajst-30556	213	13	,	,	PUNCT
ajst-30556	213	14	et	et	PROPN
ajst-30556	213	15	al	al	PROPN
ajst-30556	213	16	.	.	PUNCT
ajst-30556	214	1	new	new	ADJ
ajst-30556	214	2	algorithms	algorithm	NOUN
ajst-30556	214	3	for	for	ADP
ajst-30556	214	4	continuous	continuous	ADJ
ajst-30556	214	5	distributed	distribute	VERB
ajst-30556	214	6	constraint	constraint	NOUN
ajst-30556	214	7	optimization	optimization	NOUN
ajst-30556	214	8	problems	problem	NOUN
ajst-30556	214	9	[	[	X
ajst-30556	214	10	c]//	c]//	ADJ
ajst-30556	214	11	proceedings	proceeding	NOUN
ajst-30556	214	12	of	of	ADP
ajst-30556	214	13	the	the	DET
ajst-30556	214	14	19th	19th	ADJ
ajst-30556	214	15	international	international	ADJ
ajst-30556	214	16	conference	conference	NOUN
ajst-30556	214	17	on	on	ADP
ajst-30556	214	18	autonomous	autonomous	ADJ
ajst-30556	214	19	agents	agent	NOUN
ajst-30556	214	20	and	and	CCONJ
ajst-30556	214	21	multiagent	multiagent	NOUN
ajst-30556	214	22	systems	system	NOUN
ajst-30556	214	23	.	.	PUNCT
ajst-30556	215	1	2020	2020	NUM
ajst-30556	215	2	:	:	PUNCT
ajst-30556	215	3	502	502	NUM
ajst-30556	215	4	-	-	SYM
ajst-30556	215	5	510	510	NUM
ajst-30556	215	6	.	.	PUNCT
ajst-30556	216	1	[	[	X
ajst-30556	216	2	10	10	NUM
ajst-30556	216	3	]	]	X
ajst-30556	216	4	choudhury	choudhury	PROPN
ajst-30556	216	5	m	m	PROPN
ajst-30556	216	6	,	,	PUNCT
ajst-30556	216	7	mahmud	mahmud	PROPN
ajst-30556	216	8	s	s	PART
ajst-30556	216	9	,	,	PUNCT
ajst-30556	216	10	khan	khan	PROPN
ajst-30556	216	11	m	m	PROPN
ajst-30556	216	12	m.	m.	NOUN
ajst-30556	216	13	a	a	DET
ajst-30556	216	14	particle	particle	NOUN
ajst-30556	216	15	swarm	swarm	NOUN
ajst-30556	216	16	based	base	VERB
ajst-30556	216	17	algorithm	algorithm	NOUN
ajst-30556	216	18	for	for	ADP
ajst-30556	216	19	functional	functional	ADJ
ajst-30556	216	20	distributed	distribute	VERB
ajst-30556	216	21	constraint	constraint	NOUN
ajst-30556	216	22	optimization	optimization	NOUN
ajst-30556	216	23	problems[c]//proceedings	problems[c]//proceeding	NOUN
ajst-30556	216	24	of	of	ADP
ajst-30556	216	25	the	the	DET
ajst-30556	216	26	aaai	aaai	PROPN
ajst-30556	216	27	conference	conference	NOUN
ajst-30556	216	28	on	on	ADP
ajst-30556	216	29	artificial	artificial	ADJ
ajst-30556	216	30	intelligence	intelligence	NOUN
ajst-30556	216	31	.	.	PUNCT
ajst-30556	217	1	2020	2020	NUM
ajst-30556	217	2	,	,	PUNCT
ajst-30556	217	3	34(05	34(05	NUM
ajst-30556	217	4	):	):	PUNCT
ajst-30556	217	5	7111	7111	NUM
ajst-30556	217	6	-	-	SYM
ajst-30556	217	7	7118	7118	NUM
ajst-30556	217	8	.	.	PUNCT
ajst-30556	218	1	[	[	X
ajst-30556	218	2	11	11	NUM
ajst-30556	218	3	]	]	X
ajst-30556	218	4	shi	shi	PROPN
ajst-30556	218	5	m	m	PROPN
ajst-30556	218	6	,	,	PUNCT
ajst-30556	218	7	liao	liao	PROPN
ajst-30556	218	8	x	x	PROPN
ajst-30556	218	9	,	,	PUNCT
ajst-30556	218	10	chen	chen	PROPN
ajst-30556	218	11	y.	y.	PROPN
ajst-30556	218	12	a	a	DET
ajst-30556	218	13	particle	particle	NOUN
ajst-30556	218	14	swarm	swarm	NOUN
ajst-30556	218	15	with	with	ADP
ajst-30556	218	16	local	local	ADJ
ajst-30556	218	17	decision	decision	NOUN
ajst-30556	218	18	algorithm	algorithm	NOUN
ajst-30556	218	19	for	for	ADP
ajst-30556	218	20	functional	functional	ADJ
ajst-30556	218	21	distributed	distribute	VERB
ajst-30556	218	22	constraint	constraint	NOUN
ajst-30556	218	23	optimization	optimization	NOUN
ajst-30556	218	24	problems[j	problems[j	NOUN
ajst-30556	218	25	]	]	PUNCT
ajst-30556	218	26	.	.	PUNCT
ajst-30556	219	1	international	international	ADJ
ajst-30556	219	2	journal	journal	PROPN
ajst-30556	219	3	of	of	ADP
ajst-30556	219	4	pattern	pattern	NOUN
ajst-30556	219	5	recognition	recognition	NOUN
ajst-30556	219	6	and	and	CCONJ
ajst-30556	219	7	artificial	artificial	ADJ
ajst-30556	219	8	intelligence	intelligence	NOUN
ajst-30556	219	9	,	,	PUNCT
ajst-30556	219	10	2022	2022	NUM
ajst-30556	219	11	,	,	PUNCT
ajst-30556	219	12	36(12	36(12	NUM
ajst-30556	219	13	):	):	PUNCT
ajst-30556	219	14	2259025	2259025	NUM
ajst-30556	219	15	.	.	PUNCT
ajst-30556	220	1	[	[	X
ajst-30556	220	2	12	12	NUM
ajst-30556	220	3	]	]	PUNCT
ajst-30556	220	4	sarker	sarker	NOUN
ajst-30556	220	5	a	a	PROPN
ajst-30556	220	6	,	,	PUNCT
ajst-30556	220	7	choudhury	choudhury	PROPN
ajst-30556	220	8	m	m	PROPN
ajst-30556	220	9	,	,	PUNCT
ajst-30556	220	10	khan	khan	PROPN
ajst-30556	220	11	m	m	PROPN
ajst-30556	220	12	m.	m.	NOUN
ajst-30556	220	13	a	a	DET
ajst-30556	220	14	local	local	ADJ
ajst-30556	220	15	search	search	NOUN
ajst-30556	220	16	based	base	VERB
ajst-30556	220	17	approach	approach	NOUN
ajst-30556	220	18	to	to	PART
ajst-30556	220	19	solve	solve	VERB
ajst-30556	220	20	continuous	continuous	ADJ
ajst-30556	220	21	dcops[c]//proceedings	dcops[c]//proceeding	NOUN
ajst-30556	220	22	of	of	ADP
ajst-30556	220	23	the	the	DET
ajst-30556	220	24	20th	20th	ADJ
ajst-30556	220	25	international	international	ADJ
ajst-30556	220	26	conference	conference	NOUN
ajst-30556	220	27	on	on	ADP
ajst-30556	220	28	autonomous	autonomous	ADJ
ajst-30556	220	29	agents	agent	NOUN
ajst-30556	220	30	and	and	CCONJ
ajst-30556	220	31	multiagent	multiagent	NOUN
ajst-30556	220	32	systems	system	NOUN
ajst-30556	220	33	.	.	PUNCT
ajst-30556	221	1	2021	2021	NUM
ajst-30556	221	2	:	:	PUNCT
ajst-30556	221	3	1127	1127	NUM
ajst-30556	221	4	-	-	SYM
ajst-30556	221	5	1135	1135	NUM
ajst-30556	221	6	.	.	PUNCT
ajst-30556	222	1	[	[	X
ajst-30556	222	2	13	13	NUM
ajst-30556	222	3	]	]	PUNCT
ajst-30556	222	4	yu	yu	PROPN
ajst-30556	222	5	z	z	PROPN
ajst-30556	222	6	,	,	PUNCT
ajst-30556	222	7	chen	chen	PROPN
ajst-30556	222	8	z	z	PROPN
ajst-30556	222	9	,	,	PUNCT
ajst-30556	222	10	he	he	PRON
ajst-30556	222	11	j	j	PROPN
ajst-30556	222	12	,	,	PUNCT
ajst-30556	222	13	et	et	PROPN
ajst-30556	222	14	al	al	PROPN
ajst-30556	222	15	.	.	PUNCT
ajst-30556	223	1	a	a	DET
ajst-30556	223	2	partial	partial	ADJ
ajst-30556	223	3	decision	decision	NOUN
ajst-30556	223	4	scheme	scheme	NOUN
ajst-30556	223	5	for	for	ADP
ajst-30556	223	6	local	local	ADJ
ajst-30556	223	7	search	search	NOUN
ajst-30556	223	8	algorithms	algorithm	NOUN
ajst-30556	223	9	for	for	ADP
ajst-30556	223	10	distributed	distribute	VERB
ajst-30556	223	11	constraint	constraint	NOUN
ajst-30556	223	12	optimization	optimization	NOUN
ajst-30556	223	13	problems[c]//proceedings	problems[c]//proceeding	NOUN
ajst-30556	223	14	of	of	ADP
ajst-30556	223	15	the	the	DET
ajst-30556	223	16	16th	16th	ADJ
ajst-30556	223	17	conference	conference	NOUN
ajst-30556	223	18	on	on	ADP
ajst-30556	223	19	autonomous	autonomous	ADJ
ajst-30556	223	20	agents	agent	NOUN
ajst-30556	223	21	and	and	CCONJ
ajst-30556	223	22	multiagent	multiagent	NOUN
ajst-30556	223	23	systems	system	NOUN
ajst-30556	223	24	.	.	PUNCT
ajst-30556	224	1	2017	2017	NUM
ajst-30556	224	2	:	:	PUNCT
ajst-30556	224	3	187	187	NUM
ajst-30556	224	4	-	-	SYM
ajst-30556	224	5	194	194	NUM
ajst-30556	224	6	.	.	PUNCT