18
Soft Computing Techniques
Richard R. Brooks
Clemson University
18.6 Artificial Neural Networks
18.1 Problem Statement
When trade-offs in an implementation have been identified, many design issues become optimization problems. A very large class of combinatorial optimization problems can be shown to be NP-hard. So that large instances of the problems cannot be solved given current technologies. There is a good chance that it may never be tractable to find the optimal solutions to any of these problems within a reasonable period of time. In spite ...
Get Distributed Sensor Networks, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
