An empirical analysis of search in GSAT:
Abstract: "We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previ...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1993
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
634 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous informal accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, both the number of satisfied clauses and the branching rate scale linearly with N, the number of variables Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010463400 | ||
| 003 | DE-604 | ||
| 005 | 19951106 | ||
| 007 | t | ||
| 008 | 951106s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31073888 | ||
| 035 | |a (DE-599)BVBBV010463400 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Gent, Ian P. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An empirical analysis of search in GSAT |c Ian P. Gent and Toby Walsh |
| 264 | 1 | |a Edinburgh |c 1993 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 634 | |
| 520 | 3 | |a Abstract: "We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous informal accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, both the number of satisfied clauses and the branching rate scale linearly with N, the number of variables | |
| 520 | 3 | |a Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms. | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Artificial intelligence | |
| 700 | 1 | |a Walsh, Toby |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 634 |w (DE-604)BV010450646 |9 634 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006971787 | ||
Datensatz im Suchindex
| _version_ | 1804124895354814464 |
|---|---|
| any_adam_object | |
| author | Gent, Ian P. Walsh, Toby |
| author_facet | Gent, Ian P. Walsh, Toby |
| author_role | aut aut |
| author_sort | Gent, Ian P. |
| author_variant | i p g ip ipg t w tw |
| building | Verbundindex |
| bvnumber | BV010463400 |
| ctrlnum | (OCoLC)31073888 (DE-599)BVBBV010463400 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02277nam a2200373 cb4500</leader><controlfield tag="001">BV010463400</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951106 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951106s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31073888</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010463400</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gent, Ian P.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An empirical analysis of search in GSAT</subfield><subfield code="c">Ian P. Gent and Toby Walsh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</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="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">634</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous informal accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, both the number of satisfied clauses and the branching rate scale linearly with N, the number of variables</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Walsh, Toby</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">634</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">634</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006971787</subfield></datafield></record></collection> |
| id | DE-604.BV010463400 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:56Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006971787 |
| oclc_num | 31073888 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Gent, Ian P. Verfasser aut An empirical analysis of search in GSAT Ian P. Gent and Toby Walsh Edinburgh 1993 16 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 634 Abstract: "We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous informal accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, both the number of satisfied clauses and the branching rate scale linearly with N, the number of variables Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms. Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence Walsh, Toby Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 634 (DE-604)BV010450646 634 |
| spellingShingle | Gent, Ian P. Walsh, Toby An empirical analysis of search in GSAT Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| title | An empirical analysis of search in GSAT |
| title_auth | An empirical analysis of search in GSAT |
| title_exact_search | An empirical analysis of search in GSAT |
| title_full | An empirical analysis of search in GSAT Ian P. Gent and Toby Walsh |
| title_fullStr | An empirical analysis of search in GSAT Ian P. Gent and Toby Walsh |
| title_full_unstemmed | An empirical analysis of search in GSAT Ian P. Gent and Toby Walsh |
| title_short | An empirical analysis of search in GSAT |
| title_sort | an empirical analysis of search in gsat |
| topic | Bionics and artificial intelligence sigle Computer software sigle Mathematics sigle Künstliche Intelligenz Mathematik Artificial intelligence |
| topic_facet | Bionics and artificial intelligence Computer software Mathematics Künstliche Intelligenz Mathematik Artificial intelligence |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT gentianp anempiricalanalysisofsearchingsat AT walshtoby anempiricalanalysisofsearchingsat |