Worst-case analyses of self-organizing sequential search heuristics:
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pittsburgh, Pa.
1983
|
| Schriftenreihe: | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS
83,121 |
| Schlagworte: | |
| Zusammenfassung: | The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed in the worst-case sense, and that the relative merit of the heuristics under this analysis is different than in the probabilistic analyses. Simulations show that the relative merit of the heuristics on real data is closer to that of the new worst-case analyses rather than that of the previous probabilistic analyses. (Author). |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075539 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1983 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227585561 | ||
| 035 | |a (DE-599)BVBBV009075539 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bentley, Jon Louis |e Verfasser |0 (DE-588)122397037 |4 aut | |
| 245 | 1 | 0 | |a Worst-case analyses of self-organizing sequential search heuristics |c Jon L. Bentley ; Catherine C. MacGeoch* |
| 264 | 1 | |a Pittsburgh, Pa. |c 1983 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |v 83,121 | |
| 520 | 3 | |a The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed in the worst-case sense, and that the relative merit of the heuristics under this analysis is different than in the probabilistic analyses. Simulations show that the relative merit of the heuristics on real data is closer to that of the new worst-case analyses rather than that of the previous probabilistic analyses. (Author). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Asymptotic series |2 dtict | |
| 650 | 7 | |a Heuristic methods |2 dtict | |
| 650 | 7 | |a Probability distribution functions |2 dtict | |
| 650 | 7 | |a Searching |2 dtict | |
| 650 | 7 | |a Sequences |2 dtict | |
| 650 | 7 | |a Statistical tests |2 dtict | |
| 650 | 7 | |a Statistics and Probability |2 scgdst | |
| 650 | 7 | |a Word lists |2 dtict | |
| 700 | 1 | |a MacGeoch, Catherine C. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: CMU-CS |t Carnegie-Mellon University <Pittsburgh, Pa.> |v 83,121 |w (DE-604)BV006187264 |9 83,121 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006012882 | ||
Datensatz im Suchindex
| _version_ | 1804123489271021568 |
|---|---|
| any_adam_object | |
| author | Bentley, Jon Louis MacGeoch, Catherine C. |
| author_GND | (DE-588)122397037 |
| author_facet | Bentley, Jon Louis MacGeoch, Catherine C. |
| author_role | aut aut |
| author_sort | Bentley, Jon Louis |
| author_variant | j l b jl jlb c c m cc ccm |
| building | Verbundindex |
| bvnumber | BV009075539 |
| ctrlnum | (OCoLC)227585561 (DE-599)BVBBV009075539 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02023nam a2200397 cb4500</leader><controlfield tag="001">BV009075539</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1983 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227585561</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075539</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bentley, Jon Louis</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122397037</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Worst-case analyses of self-organizing sequential search heuristics</subfield><subfield code="c">Jon L. Bentley ; Catherine C. MacGeoch*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pittsburgh, Pa.</subfield><subfield code="c">1983</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">Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS</subfield><subfield code="v">83,121</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed in the worst-case sense, and that the relative merit of the heuristics under this analysis is different than in the probabilistic analyses. Simulations show that the relative merit of the heuristics on real data is closer to that of the new worst-case analyses rather than that of the previous probabilistic analyses. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Asymptotic series</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Heuristic methods</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Probability distribution functions</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Searching</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequences</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Statistical tests</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Statistics and Probability</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Word lists</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">MacGeoch, Catherine C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CMU-CS</subfield><subfield code="t">Carnegie-Mellon University <Pittsburgh, Pa.></subfield><subfield code="v">83,121</subfield><subfield code="w">(DE-604)BV006187264</subfield><subfield code="9">83,121</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006012882</subfield></datafield></record></collection> |
| id | DE-604.BV009075539 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006012882 |
| oclc_num | 227585561 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| record_format | marc |
| series2 | Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS |
| spelling | Bentley, Jon Louis Verfasser (DE-588)122397037 aut Worst-case analyses of self-organizing sequential search heuristics Jon L. Bentley ; Catherine C. MacGeoch* Pittsburgh, Pa. 1983 16 S. txt rdacontent n rdamedia nc rdacarrier Carnegie-Mellon University <Pittsburgh, Pa.> / Computer Science Department: CMU-CS 83,121 The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list as they are found. Previous analyses have characterized the performance of such heuristics probabilitically. In this paper we show that the heuristics can also be analyzed in the worst-case sense, and that the relative merit of the heuristics under this analysis is different than in the probabilistic analyses. Simulations show that the relative merit of the heuristics on real data is closer to that of the new worst-case analyses rather than that of the previous probabilistic analyses. (Author). Algorithms dtict Asymptotic series dtict Heuristic methods dtict Probability distribution functions dtict Searching dtict Sequences dtict Statistical tests dtict Statistics and Probability scgdst Word lists dtict MacGeoch, Catherine C. Verfasser aut Computer Science Department: CMU-CS Carnegie-Mellon University <Pittsburgh, Pa.> 83,121 (DE-604)BV006187264 83,121 |
| spellingShingle | Bentley, Jon Louis MacGeoch, Catherine C. Worst-case analyses of self-organizing sequential search heuristics Algorithms dtict Asymptotic series dtict Heuristic methods dtict Probability distribution functions dtict Searching dtict Sequences dtict Statistical tests dtict Statistics and Probability scgdst Word lists dtict |
| title | Worst-case analyses of self-organizing sequential search heuristics |
| title_auth | Worst-case analyses of self-organizing sequential search heuristics |
| title_exact_search | Worst-case analyses of self-organizing sequential search heuristics |
| title_full | Worst-case analyses of self-organizing sequential search heuristics Jon L. Bentley ; Catherine C. MacGeoch* |
| title_fullStr | Worst-case analyses of self-organizing sequential search heuristics Jon L. Bentley ; Catherine C. MacGeoch* |
| title_full_unstemmed | Worst-case analyses of self-organizing sequential search heuristics Jon L. Bentley ; Catherine C. MacGeoch* |
| title_short | Worst-case analyses of self-organizing sequential search heuristics |
| title_sort | worst case analyses of self organizing sequential search heuristics |
| topic | Algorithms dtict Asymptotic series dtict Heuristic methods dtict Probability distribution functions dtict Searching dtict Sequences dtict Statistical tests dtict Statistics and Probability scgdst Word lists dtict |
| topic_facet | Algorithms Asymptotic series Heuristic methods Probability distribution functions Searching Sequences Statistical tests Statistics and Probability Word lists |
| volume_link | (DE-604)BV006187264 |
| work_keys_str_mv | AT bentleyjonlouis worstcaseanalysesofselforganizingsequentialsearchheuristics AT macgeochcatherinec worstcaseanalysesofselforganizingsequentialsearchheuristics |