460 search results - page 18 / 92 » Neural Network Algorithms for the p-Median Problem |
177
Voted
TAINN
2005
Springer
15 years 9 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
123
Voted
IJMC
2006
15 years 3 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
119
Voted
FPGA
2009
ACM
15 years 10 months ago
2009
ACM
Despite the popularity and success of neural networks in research, the number of resulting commercial or industrial applications have been limited. A primary cause of this lack of...
109
Voted
ICONIP
2007
15 years 5 months ago
2007
One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n2 )[1]. The a...
131
Voted
TNN
1998
15 years 3 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...