The Hop.fteld neural networks are ~:~tended to handle inequality constraints where linear combinations of variables are lower-or upper-bounded. Then b)' eigenvahw analysis, the effects q/'the inequality constraints are analyzed and the lbllowing results are obtained" (a) f a combinatorial solution o
β¦ LIBER β¦
Solving the optimal network problem
β Scribed by T.B. Boffey; A.I. Hinxman
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 761 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Solving inequality constrained combinato
β
Shigeo Abe; Junzo Kawakami; Kotaroo Hirasawa
π
Article
π
1992
π
Elsevier Science
π
English
β 543 KB
Weighted parallel problem solving by opt
β
Yasunari Obuchi; Hironari Masui; Masaru Ohki
π
Article
π
1996
π
Elsevier Science
π
English
β 790 KB
Solving degenerate optimization problems
β
Derek M. Wells
π
Article
π
1992
π
Elsevier Science
π
English
β 894 KB
Method of solving the network transport
β
V.A. Gorelik; M.S. Shtilman
π
Article
π
1964
π
Elsevier Science
β 458 KB
A case study of solving optimization pro
β
X. Xu; S. Chen; W.T. Tsai; N.K. Huang
π
Article
π
1988
π
Elsevier Science
π
English
β 66 KB
Minority influence and optimal problem s
β
Robin Martin; Miles Hewstone
π
Article
π
1999
π
John Wiley and Sons
π
English
β 105 KB
π 1 views
An analogous thinking task was used to test Nemeth's ConvergentΒ±Divergent theory of majority and minority inΒ―uence. Participants read a (base) problem and one of three solutions (one of which is considered the `best' solution). They then generated solutions to a second (target) problem which shared