Soft computing:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Oxford
Alpha Science Internat.
2008
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. [217] - 226 |
| Beschreibung: | XX, 229 S. graph. Darst. |
| ISBN: | 9781842654378 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023410148 | ||
| 003 | DE-604 | ||
| 005 | 20091021 | ||
| 007 | t | ||
| 008 | 080723s2008 d||| |||| 00||| eng d | ||
| 020 | |a 9781842654378 |c hbk. |9 978-1-84265-437-8 | ||
| 035 | |a (OCoLC)227272370 | ||
| 035 | |a (DE-599)BVBBV023410148 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-20 |a DE-91G | ||
| 050 | 0 | |a QA76.9.S63 | |
| 082 | 0 | |a 006.3 |2 22 | |
| 084 | |a ST 301 |0 (DE-625)143651: |2 rvk | ||
| 084 | |a DAT 718f |2 stub | ||
| 100 | 1 | |a Pratihar, Dilip Kumar |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Soft computing |c Dilip Kumar Pratihar |
| 264 | 1 | |a Oxford |b Alpha Science Internat. |c 2008 | |
| 300 | |a XX, 229 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. [217] - 226 | ||
| 650 | 4 | |a Algorithmes génétiques | |
| 650 | 4 | |a Informatique douce | |
| 650 | 4 | |a Logique floue | |
| 650 | 4 | |a Réseaux neuronaux (Informatique) | |
| 650 | 4 | |a Soft computing | |
| 650 | 0 | 7 | |a Soft Computing |0 (DE-588)4455833-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Soft Computing |0 (DE-588)4455833-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016592771&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016592771 | ||
Datensatz im Suchindex
| _version_ | 1804137797561352192 |
|---|---|
| adam_text | IMAGE 1
SOFT
COMPUTING
DILIP KUMAR PRATIHAR
ALPHA SCIENCE INTERNATIONAL LTD. OXFORD, U.K.
IMAGE 2
CONTENTS
PREFACE VII
NOMENCLATURE XV
GREEK SYMBOLS XVII
ABBREVIATIONS XIX
1 INTRODUCTION 1
1.1 HARD COMPUTING 1
1.1.1 FEATURES OF HARD COMPUTING 1
1.2 SOFT COMPUTING 2
1.2.1 FEATURES OF SOFT COMPUTING 3
1.3 HYBRID COMPUTING 3
1.4 SUMMARY 5
1.5 EXERCISE 5
2 OPTIMIZATION AND SOME TRADITIONAL METHODS 7
2.1 INTRODUCTION TO OPTIMIZATION 7
2.1.1 A PRACTICAL EXAMPLE 9
2.1.2 CLASSIFICATION OF OPTIMIZATION PROBLEMS 10
2.1.3 PRINCIPLE OF OPTIMIZATION 12
2.1.4 DUALITY PRINCIPLE 13
2.2 TRADITIONAL METHODS OF OPTIMIZATION 14
2.2.1 EXHAUSTIVE SEARCH METHOD 14
2.2.2 RANDOM WALK METHOD 20
2.2.3 STEEPEST DESCENT METHOD 23
2.2.4 DRAWBACKS OF TRADITIONAL OPTIMIZATION METHODS 26
2.3 SUMMARY 27
2.4 EXERCISE 27
3 INTRODUCTION TO GENETIC ALGORITHMS 29
3.1 WORKING CYCLE OF A GENETIC ALGORITHM 29
3.2 BINARY-CODED GA 31
3.2.1 CROSSOVER OR MUTATION ? 39
3.2.2 A HAND CALCULATION 39
3.2.3 FUNDAMENTAL THEOREM OF GA/SCHEMA THEOREM 41
3.2.4 LIMITATIONS OF A BINARY-CODED GA 43
3.3 GA-PARAMETERS SETTING 44
IMAGE 3
CONTENTS
3.4 CONSTRAINTS HANDLING IN GA 46
3.4.1 PENALTY FUNCTION APPROACH 47
3.5 ADVANTAGES AND DISADVANTAGES OF GENETIC ALGORITHM 48
3.6 SUMMARY 49
3.7 EXERCISE 50
I
4 S O ME SPECIALIZED G E N E T IC A L G O R I T H MS 53 S
4.1 REAL-CODED GA 53
4.1.1 CROSSOVER OPERATORS 53
4.1.2 MUTATION OPERATORS 57
4.2 MICRO-GA 59
4.3 VISUALIZED INTERACTIVE GA 59
4.3.1 MAPPING METHODS 60
4.3.2 SIMULATION RESULTS 63
4.3.3 WORKING PRINCIPLE OF THE VIGA 65
4.4 SCHEDULING GA 66
4.4.1 EDGE RECOMBINATION 67
4.4.2 ORDER CROSSOVER #1 69
4.4.3 ORDER CROSSOVER #2 70
4.4.4 CYCLE CROSSOVER 70
4.4.5 POSITION-BASED CROSSOVER 71
4.4.6 PARTIALLY MAPPED CROSSOVER (PMX) 72
4.5 SUMMARY 74
4.6 EXERCISE 74
5 I N T R O D U C T I ON TO FUZZY S E TS 77
5.1 CRISP SETS 77
5.1.1 NOTATIONS USED IN SET THEORY 78
5.1.2 CRISP SET OPERATIONS 79
5.1.3 PROPERTIES OF CRISP SETS 80
5.2 FUZZY SETS 82
5.2.1 REPRESENTATION OF A FUZZY SET 82
5.2.2 DIFFERENCE BETWEEN CRISP SET AND FUZZY SET 87
5.2.3 A FEW DEFINITIONS IN FUZZY SETS 88
5.2.4 SOME STANDARD OPERATIONS IN FUZZY SETS 90
5.2.5 PROPERTIES OF FUZZY SETS 97
5.3 SUMMARY 98
5.4 EXERCISE 98
6 FUZZY R E A S O N I NG AND CLUSTERING 101
6.1 INTRODUCTION 101
6.2 FUZZY LOGIC CONTROLLER 101
6.2.1 TWO MAJOR FORMS OF FUZZY LOGIC CONTROLLER 102
6.2.2 HIERARCHICAL FUZZY LOGIC CONTROLLER 116
6.2.3 SENSITIVITY ANALYSIS 117
6.2.4 ADVANTAGES AND DISADVANTAGES OF FUZZY LOGIC CONTROLLER 118
6.3 FUZZY CLUSTERING 118
6.3.1 FUZZY C-MEANS CLUSTERING * 118
6.3.2 ENTROPY-BASED FUZZY CLUSTERING 123
6.4 SUMMARY 127
6.5 EXERCISE 128
IMAGE 4
CONTENTS
XIII
7 F U N D A M E N T A LS OF N E U R AL N E T W O R KS 131
7.1 INTRODUCTION 131
7.1.1 BIOLOGICAL NEURON 131
7.1.2 ARTIFICIAL NEURON 132
7.1.3 A LAYER OF NEURONS 135
7.1.4 MULTIPLE LAYERS OF NEURONS 136
7.2 STATIC VS. DYNAMIC NEURAL NETWORKS 137
7.3 TRAINING OF NEURAL NETWORKS 137
7.3.1 SUPERVISED LEARNING 138
7.3.2 UN-SUPERVISED LEARNING 138
7.3.3 INCREMENTAL TRAINING 138
7.3.4 BATCH TRAINING 138
7.4 SUMMARY 139
7.5 EXERCISE 139
8 S O ME E X A M P L ES OF N E U R AL N E T W O R KS 141
8.1 INTRODUCTION 141
8.2 MULTI-LAYER FEED-FORWARD NEURAL NETWORK (MLFFNN) 141
8.2.1 FORWARD CALCULATION 143
8.2.2 TRAINING OF NETWORK USING BACK-PROPAGATION ALGORITHM 144
8.2.3 STEPS TO BE FOLLOWED TO DESIGN A SUITABLE NN 148
8.2.4 ADVANTAGES AND DISADVANTAGES 149
8.2.5 A NUMERICAL EXAMPLE 149
8.3 RADIAL BASIS FUNCTION NETWORK (RBFN) 152
8.3.1 FORWARD CALCULATIONS 154
8.3.2 TUNING OF RBFN USING BACK-PROPAGATION ALGORITHM 156
8.4 SELF-ORGANIZING MAP (SOM) 159
8.4.1 COMPETITION 160
8.4.2 COOPERATION 160
8.4.3 UPDATING 161
8.4.4 FINAL MAPPING 161
8.4.5 SIMULATION RESULTS 162
8.5 RECURRENT NEURAL NETWORKS (RNNS) 162
8.5.1 ELMAN NETWORK 163
8.5.2 JORDAN NETWORK 163
8.5.3 COMBINED ELMAN AND JORDAN NETWORK 164
8.6 SUMMARY ,* 165
8.7 EXERCISE 165
9 COMBINED G E N E T IC A L G O R I T H M S: FUZZY LOGIC 167
9.1 INTRODUCTION 167
9.2 FUZZY-GENETIC ALGORITHM 167
9.3 GENETIC-FUZZY SYSTEM 170
9.3.1 A BRIEF LITERATURE REVIEW 170
9.3.2 WORKING PRINCIPLE OF GENETIC-FUZZY SYSTEMS 173
9.4 SUMMARY 180
9.5 EXERCISE 180
10 COMBINED G E N E T IC A L G O R I T H M S: N E U R AL N E T W O R KS
183
10.1 INTRODUCTION 183
10.2 WORKING PRINCIPLE OF A GENETIC-NEURAL SYSTEM 185
10.2.1 FORWARD CALCULATION 186
IMAGE 5
XIV CONTENTS
10.2.2 A HAND CALCULATION 189
10.3 SUMMARY 191
10.4 EXERCISE 191
11 C O M B I N ED N E U R AL N E T W O R K S: FUZZY LOGIC 193
11.1 INTRODUCTION 193 I
11.2 NEURO-FUZZY SYSTEM WORKING BASED ON MAMDANI APPROACH 194 ?
11.2.1 TUNING OF THE NEURO-FUZZY SYSTEM USING A BACK-PROPAGATION
ALGORITHML99 11.2.2 TUNING OF THE NEURO-FUZZY SYSTEM USING A GENETIC
ALGORITHM . . . 200 11.2.3 A NUMERICAL EXAMPLE 201
11.3 NEURO-FUZZY SYSTEM BASED ON TAKAGI AND SUGENO S APPROACH 206
11.3.1 TUNING OF THE ANFIS USING A GENETIC ALGORITHM 209
11.3.2 A NUMERICAL EXAMPLE 210
11.4 SUMMARY 214
11.5 EXERCISE 214
REFERENCES 217
I N D EX 227
|
| adam_txt |
IMAGE 1
SOFT
COMPUTING
DILIP KUMAR PRATIHAR
ALPHA SCIENCE INTERNATIONAL LTD. OXFORD, U.K.
IMAGE 2
CONTENTS
PREFACE VII
NOMENCLATURE XV
GREEK SYMBOLS XVII
ABBREVIATIONS XIX
1 INTRODUCTION 1
1.1 HARD COMPUTING 1
1.1.1 FEATURES OF HARD COMPUTING 1
1.2 SOFT COMPUTING 2
1.2.1 FEATURES OF SOFT COMPUTING 3
1.3 HYBRID COMPUTING 3
1.4 SUMMARY 5
1.5 EXERCISE 5
2 OPTIMIZATION AND SOME TRADITIONAL METHODS 7
2.1 INTRODUCTION TO OPTIMIZATION 7
2.1.1 A PRACTICAL EXAMPLE 9
2.1.2 CLASSIFICATION OF OPTIMIZATION PROBLEMS 10
2.1.3 PRINCIPLE OF OPTIMIZATION 12
2.1.4 DUALITY PRINCIPLE 13
2.2 TRADITIONAL METHODS OF OPTIMIZATION 14
2.2.1 EXHAUSTIVE SEARCH METHOD 14
2.2.2 RANDOM WALK METHOD 20
2.2.3 STEEPEST DESCENT METHOD 23
2.2.4 DRAWBACKS OF TRADITIONAL OPTIMIZATION METHODS 26
2.3 SUMMARY 27
2.4 EXERCISE 27
3 INTRODUCTION TO GENETIC ALGORITHMS 29
3.1 WORKING CYCLE OF A GENETIC ALGORITHM 29
3.2 BINARY-CODED GA 31
3.2.1 CROSSOVER OR MUTATION ? 39
3.2.2 A HAND CALCULATION 39
3.2.3 FUNDAMENTAL THEOREM OF GA/SCHEMA THEOREM 41
3.2.4 LIMITATIONS OF A BINARY-CODED GA 43
3.3 GA-PARAMETERS SETTING 44
IMAGE 3
CONTENTS
3.4 CONSTRAINTS HANDLING IN GA 46
3.4.1 PENALTY FUNCTION APPROACH 47
3.5 ADVANTAGES AND DISADVANTAGES OF GENETIC ALGORITHM 48
3.6 SUMMARY 49
3.7 EXERCISE 50
I
4 S O ME SPECIALIZED G E N E T IC A L G O R I T H MS 53 S
4.1 REAL-CODED GA 53
4.1.1 CROSSOVER OPERATORS 53
4.1.2 MUTATION OPERATORS 57
4.2 MICRO-GA 59
4.3 VISUALIZED INTERACTIVE GA 59
4.3.1 MAPPING METHODS 60
4.3.2 SIMULATION RESULTS 63
4.3.3 WORKING PRINCIPLE OF THE VIGA 65
4.4 SCHEDULING GA 66
4.4.1 EDGE RECOMBINATION 67
4.4.2 ORDER CROSSOVER #1 69
4.4.3 ORDER CROSSOVER #2 70
4.4.4 CYCLE CROSSOVER 70
4.4.5 POSITION-BASED CROSSOVER 71
4.4.6 PARTIALLY MAPPED CROSSOVER (PMX) 72
4.5 SUMMARY 74
4.6 EXERCISE 74
5 I N T R O D U C T I ON TO FUZZY S E TS 77
5.1 CRISP SETS 77
5.1.1 NOTATIONS USED IN SET THEORY 78
5.1.2 CRISP SET OPERATIONS 79
5.1.3 PROPERTIES OF CRISP SETS 80
5.2 FUZZY SETS 82
5.2.1 REPRESENTATION OF A FUZZY SET 82
5.2.2 DIFFERENCE BETWEEN CRISP SET AND FUZZY SET 87
5.2.3 A FEW DEFINITIONS IN FUZZY SETS 88
5.2.4 SOME STANDARD OPERATIONS IN FUZZY SETS 90
5.2.5 PROPERTIES OF FUZZY SETS 97
5.3 SUMMARY 98
5.4 EXERCISE 98
6 FUZZY R E A S O N I NG AND CLUSTERING 101
6.1 INTRODUCTION 101
6.2 FUZZY LOGIC CONTROLLER 101
6.2.1 TWO MAJOR FORMS OF FUZZY LOGIC CONTROLLER 102
6.2.2 HIERARCHICAL FUZZY LOGIC CONTROLLER 116
6.2.3 SENSITIVITY ANALYSIS 117
6.2.4 ADVANTAGES AND DISADVANTAGES OF FUZZY LOGIC CONTROLLER 118
6.3 FUZZY CLUSTERING 118
6.3.1 FUZZY C-MEANS CLUSTERING * 118
6.3.2 ENTROPY-BASED FUZZY CLUSTERING 123
6.4 SUMMARY 127
6.5 EXERCISE 128
IMAGE 4
CONTENTS
XIII
7 F U N D A M E N T A LS OF N E U R AL N E T W O R KS 131
7.1 INTRODUCTION 131
7.1.1 BIOLOGICAL NEURON 131
7.1.2 ARTIFICIAL NEURON 132
7.1.3 A LAYER OF NEURONS 135
7.1.4 MULTIPLE LAYERS OF NEURONS 136
7.2 STATIC VS. DYNAMIC NEURAL NETWORKS 137
7.3 TRAINING OF NEURAL NETWORKS 137
7.3.1 SUPERVISED LEARNING 138
7.3.2 UN-SUPERVISED LEARNING 138
7.3.3 INCREMENTAL TRAINING 138
7.3.4 BATCH TRAINING 138
7.4 SUMMARY 139
7.5 EXERCISE 139
8 S O ME E X A M P L ES OF N E U R AL N E T W O R KS 141
8.1 INTRODUCTION 141
8.2 MULTI-LAYER FEED-FORWARD NEURAL NETWORK (MLFFNN) 141
8.2.1 FORWARD CALCULATION 143
8.2.2 TRAINING OF NETWORK USING BACK-PROPAGATION ALGORITHM 144
8.2.3 STEPS TO BE FOLLOWED TO DESIGN A SUITABLE NN 148
8.2.4 ADVANTAGES AND DISADVANTAGES 149
8.2.5 A NUMERICAL EXAMPLE 149
8.3 RADIAL BASIS FUNCTION NETWORK (RBFN) 152
8.3.1 FORWARD CALCULATIONS 154
8.3.2 TUNING OF RBFN USING BACK-PROPAGATION ALGORITHM 156
8.4 SELF-ORGANIZING MAP (SOM) 159
8.4.1 COMPETITION 160
8.4.2 COOPERATION 160
8.4.3 UPDATING 161
8.4.4 FINAL MAPPING 161
8.4.5 SIMULATION RESULTS 162
8.5 RECURRENT NEURAL NETWORKS (RNNS) 162
8.5.1 ELMAN NETWORK 163
8.5.2 JORDAN NETWORK 163
8.5.3 COMBINED ELMAN AND JORDAN NETWORK 164
8.6 SUMMARY ,* 165
8.7 EXERCISE 165
9 COMBINED G E N E T IC A L G O R I T H M S: FUZZY LOGIC 167
9.1 INTRODUCTION 167
9.2 FUZZY-GENETIC ALGORITHM 167
9.3 GENETIC-FUZZY SYSTEM 170
9.3.1 A BRIEF LITERATURE REVIEW 170
9.3.2 WORKING PRINCIPLE OF GENETIC-FUZZY SYSTEMS 173
9.4 SUMMARY 180
9.5 EXERCISE 180
10 COMBINED G E N E T IC A L G O R I T H M S: N E U R AL N E T W O R KS
183
10.1 INTRODUCTION 183
10.2 WORKING PRINCIPLE OF A GENETIC-NEURAL SYSTEM 185
10.2.1 FORWARD CALCULATION 186
IMAGE 5
XIV CONTENTS
10.2.2 A HAND CALCULATION 189
10.3 SUMMARY 191
10.4 EXERCISE 191
11 C O M B I N ED N E U R AL N E T W O R K S: FUZZY LOGIC 193
11.1 INTRODUCTION 193 I
11.2 NEURO-FUZZY SYSTEM WORKING BASED ON MAMDANI APPROACH 194 ?
11.2.1 TUNING OF THE NEURO-FUZZY SYSTEM USING A BACK-PROPAGATION
ALGORITHML99 11.2.2 TUNING OF THE NEURO-FUZZY SYSTEM USING A GENETIC
ALGORITHM . . . 200 11.2.3 A NUMERICAL EXAMPLE 201
11.3 NEURO-FUZZY SYSTEM BASED ON TAKAGI AND SUGENO'S APPROACH 206
11.3.1 TUNING OF THE ANFIS USING A GENETIC ALGORITHM 209
11.3.2 A NUMERICAL EXAMPLE 210
11.4 SUMMARY 214
11.5 EXERCISE 214
REFERENCES 217
I N D EX 227 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Pratihar, Dilip Kumar |
| author_facet | Pratihar, Dilip Kumar |
| author_role | aut |
| author_sort | Pratihar, Dilip Kumar |
| author_variant | d k p dk dkp |
| building | Verbundindex |
| bvnumber | BV023410148 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.S63 |
| callnumber-search | QA76.9.S63 |
| callnumber-sort | QA 276.9 S63 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 301 |
| classification_tum | DAT 718f |
| ctrlnum | (OCoLC)227272370 (DE-599)BVBBV023410148 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01480nam a2200421 c 4500</leader><controlfield tag="001">BV023410148</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091021 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080723s2008 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781842654378</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-1-84265-437-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227272370</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023410148</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.S63</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 301</subfield><subfield code="0">(DE-625)143651:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 718f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pratihar, Dilip Kumar</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Soft computing</subfield><subfield code="c">Dilip Kumar Pratihar</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford</subfield><subfield code="b">Alpha Science Internat.</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 229 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. [217] - 226</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes génétiques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique douce</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logique floue</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Réseaux neuronaux (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Soft computing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Soft Computing</subfield><subfield code="0">(DE-588)4455833-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Soft Computing</subfield><subfield code="0">(DE-588)4455833-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016592771&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016592771</subfield></datafield></record></collection> |
| id | DE-604.BV023410148 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:27:14Z |
| indexdate | 2024-07-09T21:18:00Z |
| institution | BVB |
| isbn | 9781842654378 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016592771 |
| oclc_num | 227272370 |
| open_access_boolean | |
| owner | DE-703 DE-20 DE-91G DE-BY-TUM |
| owner_facet | DE-703 DE-20 DE-91G DE-BY-TUM |
| physical | XX, 229 S. graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Alpha Science Internat. |
| record_format | marc |
| spelling | Pratihar, Dilip Kumar Verfasser aut Soft computing Dilip Kumar Pratihar Oxford Alpha Science Internat. 2008 XX, 229 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. [217] - 226 Algorithmes génétiques Informatique douce Logique floue Réseaux neuronaux (Informatique) Soft computing Soft Computing (DE-588)4455833-8 gnd rswk-swf Soft Computing (DE-588)4455833-8 s DE-604 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016592771&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Pratihar, Dilip Kumar Soft computing Algorithmes génétiques Informatique douce Logique floue Réseaux neuronaux (Informatique) Soft computing Soft Computing (DE-588)4455833-8 gnd |
| subject_GND | (DE-588)4455833-8 |
| title | Soft computing |
| title_auth | Soft computing |
| title_exact_search | Soft computing |
| title_exact_search_txtP | Soft computing |
| title_full | Soft computing Dilip Kumar Pratihar |
| title_fullStr | Soft computing Dilip Kumar Pratihar |
| title_full_unstemmed | Soft computing Dilip Kumar Pratihar |
| title_short | Soft computing |
| title_sort | soft computing |
| topic | Algorithmes génétiques Informatique douce Logique floue Réseaux neuronaux (Informatique) Soft computing Soft Computing (DE-588)4455833-8 gnd |
| topic_facet | Algorithmes génétiques Informatique douce Logique floue Réseaux neuronaux (Informatique) Soft computing Soft Computing |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016592771&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT pratihardilipkumar softcomputing |