Entry Takahashi:1996:UCN from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Takahashi:1996:UCN,
author = "Yoshikane Takahashi",
title = "A unified constructive network model for
problem-solving",
journal = j-THEOR-COMP-SCI,
volume = "156",
number = "1--2",
pages = "217--261",
day = "25",
month = mar,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:48 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=156&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=156&issue=1-2&aid=2075",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C5290 (Neural computing
techniques)",
corpsource = "NTT Commun. Sci. Labs., Yokosuka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; computation theory; constituent
functions set; constraint; neural net model; neural
nets; neural network model; optimisation; optimization
problem; pattern classification; pattern matching;
problem solving; programming theory; restrictive
conditions; traveling salesman problem; travelling
salesman problem; travelling salesman problems; unified
constructive network model; unified method",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- C5290,
141(1)1,
147(1)181,
174(1)123
- classification,
158(1)161,
170(1)297,
221(1)157
- computing,
137(1)129,
138(1)211,
139(1)69,
141(1)1,
141(1)175,
147(1)181,
149(1)101,
155(1)157,
156(1)99,
157(1)115,
161(1)69,
163(1)269,
164(1)107,
164(1)299,
168(2)321,
169(1)67,
174(1)123,
180(1)115,
180(1)287,
181(1)159,
181(1)181,
181(1)195,
182(1)159,
185(2)259,
187(1)81,
187(1)87,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
190(1)61,
191(1)1,
192(2)315,
194(1)123,
194(1)225,
194(1)241,
194(1)242-1,
194(1)z,
195(1)3,
196(1)109,
196(1)153,
196(1)319,
197(1)79,
197(1)157,
197(1)171,
199(1)145,
209(1)331,
209(1)389
- condition,
138(1)201,
139(1)27,
140(2)231,
140(2)249,
141(1)311,
144(1)251,
145(1)1,
146(1)331,
151(2)487,
152(1)91,
152(1)139,
154(2)349,
155(2)321,
159(2)355,
161(1)191,
163(1)259,
164(1)287,
165(1)97,
165(2)475,
165(2)483,
166(1)49,
166(1)101,
166(1)147,
167(1)193,
173(2)513,
174(1)97,
174(1)157,
177(1)155,
180(1)61,
182(1)183,
183(1)93,
183(2)253,
187(1)3,
191(1)219,
197(1)111,
197(1)203,
202(1)231,
220(1)67
- constraint,
138(1)211,
141(1)151,
142(1)27,
142(2)141,
151(1)37,
151(1)z,
158(1)279,
160(1)365,
166(1)101,
167(1)73,
171(1)25,
172(1)233,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
175(2)349,
179(1)273,
183(2)281,
184(1)195,
185(1)81,
187(1)49,
190(2)115,
190(2)151,
192(1)77,
192(1)107,
192(2)259,
192(2)315,
193(1)149,
197(1)1,
206(1)81,
206(1)257,
221(1)179,
225(1)113
- constructive,
159(2)319,
175(1)29,
183(1)21,
194(1)243-2,
219(1)95,
219(1)267
- matching,
137(2)269,
141(1)53,
145(1)111,
145(1)381,
147(1)19,
154(2)203,
154(2)225,
155(2)321,
158(1)177,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
173(2)349,
177(2)425,
178(1)129,
180(1)115,
180(1)203,
181(1)159,
185(2)347,
191(1)205,
197(1)247-2,
198(1)1,
201(1)263,
201(1)281,
212(1)101,
220(2)469
- neural,
134(1)51,
141(1)1,
143(2)251,
147(1)181,
158(1)279,
168(2)405,
168(2)461,
172(1)91,
174(1)123,
178(1)77,
182(1)257,
185(1)15
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- pattern,
137(1)25,
138(1)113,
140(2)319,
141(1)53,
141(1)253,
141(1)283,
145(1)1,
145(1)159,
145(1)329,
145(1)357,
147(1)19,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
155(2)349,
158(1)177,
160(1)217,
163(1)117,
163(1)303,
172(1)281,
173(2)349,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
181(2)379,
184(1)195,
185(1)47,
186(1)231,
192(1)3,
196(1)71,
197(1)171,
201(1)263,
205(1)243,
206(1)1
- restrictive,
166(1)101,
186(1)199
- salesman,
158(1)279
- solving,
155(1)221,
157(1)79,
158(1)279,
160(1)145,
160(1)185,
173(1)183,
173(1)253,
186(1)83,
201(1)275,
224(1)215
- Takahashi, Yoshikane,
158(1)279
- traveling,
158(1)279
- unified,
150(1)1,
176(1)337,
190(2)363