Search (16 results, page 1 of 1)

0.18724912 = product of:
  0.37449825 = sum of:
    0.32806146 = weight(_text_:java in 4593) [ClassicSimilarity], result of:
      0.32806146 = score(doc=4593,freq=4.0), product of:
        0.49653333 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.07045517 = queryNorm
        0.6607038 = fieldWeight in 4593, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=4593)
    0.046436783 = weight(_text_:have in 4593) [ClassicSimilarity], result of:
      0.046436783 = score(doc=4593,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.20902719 = fieldWeight in 4593, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.046875 = fieldNorm(doc=4593)
  0.5 = coord(2/4)

Abstract

Presents a Guided tour system for the WWW, called Ariadne, which implements the ideas of trails and guided tours, originating from the hypertext field. Ariadne appears as a Java applet to the user and it stores guided tours in a database format separated from the WWW documents included in the tour. Itd main advantages are: an independent user interface which does not affect the layout of the documents being part of the tour, branching tours where the user may follow alternative routes, composition of existing tours into aggregate tours, overview map with indication of which parts of a tour have been visited an support for getting back on track. Ariadne is available as a research prototype, and it has been tested among a group of university students as well as casual users on the Internet

0.04832802 = product of:
  0.19331208 = sum of:
    0.19331208 = weight(_text_:java in 1871) [ClassicSimilarity], result of:
      0.19331208 = score(doc=1871,freq=2.0), product of:
        0.49653333 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.07045517 = queryNorm
        0.38932347 = fieldWeight in 1871, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0390625 = fieldNorm(doc=1871)
  0.25 = coord(1/4)

Abstract

As part of the ongoing Illinois Digital Library Initiative project, this research proposes an intelligent agent approach to Web searching. In this experiment, we developed 2 Web personal spiders based on best first search and genetic algorithm techniques, respectively. These personal spiders can dynamically take a user's selected starting homepages and search for the most closely related homepages in the Web, based on the links and keyword indexing. A graphical, dynamic, Jav-based interface was developed and is available for Web access. A system architecture for implementing such an agent-spider is presented, followed by deteiled discussions of benchmark testing and user evaluation results. In benchmark testing, although the genetic algorithm spider did not outperform the best first search spider, we found both results to be comparable and complementary. In user evaluation, the genetic algorithm spider obtained significantly higher recall value than that of the best first search spider. However, their precision values were not statistically different. The mutation process introduced in genetic algorithms allows users to find other potential relevant homepages that cannot be explored via a conventional local search process. In addition, we found the Java-based interface to be a necessary component for design of a truly interactive and dynamic Web agent

0.024217619 = product of:
  0.096870475 = sum of:
    0.096870475 = weight(_text_:und in 1981) [ClassicSimilarity], result of:
      0.096870475 = score(doc=1981,freq=20.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.6199216 = fieldWeight in 1981, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0625 = fieldNorm(doc=1981)
  0.25 = coord(1/4)

Abstract

Anhand von Beispielen entwickeln die Autoren die Grundlagen von Suchmaschinen und Intelligenten Agenten und deren Anwendungen in der Praxis. Die Methoden, im Internet und Intranet Informationen zu suchen und aufzufinden, werden ausführlich dargestellt. Die Lösungen durch Suchmaschinen und durch die Agententechnik werden beschrieben. Die Autoren behandeln ferner die Anwendungsbereiche, die architektonischen Gestaltungsmöglichkeiten von Suchmaschinen und Intelligenten Agenten und ihre Wirkung im Internet und Intranet

0.023459004 = product of:
  0.09383602 = sum of:
    0.09383602 = weight(_text_:have in 3297) [ClassicSimilarity], result of:
      0.09383602 = score(doc=3297,freq=6.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.42238668 = fieldWeight in 3297, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3297)
  0.25 = coord(1/4)

Abstract

In building intelligent network agents, computer scientists may employ a variety of different design strategies, and their design decisions can have a significant effect on the ultimative nature of network interactions. Focuses on a particular design question, the multiple-access problem: if an agent seeking a piece of information knows of several sites that have, or might have, that information, how many queries should it issue, and when? Provides a formal analysis that demonstrates the viability of cooperative responses th this question under certain assumptions. discusses the limitations of this analysis and presents the results of experiments done using a genetic-algorithms approach in which simulated network agents 'evolve' cooperative strategies under less restrictive assumptions tham those made in the formal analysis

0.015478929 = product of:
  0.061915714 = sum of:
    0.061915714 = weight(_text_:have in 1783) [ClassicSimilarity], result of:
      0.061915714 = score(doc=1783,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.2787029 = fieldWeight in 1783, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.0625 = fieldNorm(doc=1783)
  0.25 = coord(1/4)

Abstract

Describes the new breed of intelligent, mobile agents, autonomous software robots that are sent out from the home machine to seek out specific types of data. Notes that safeguards have to be built into them to avoid their being mistaken for viruses. Such agents may also be taught to cooperate with one another

0.015478929 = product of:
  0.061915714 = sum of:
    0.061915714 = weight(_text_:have in 4819) [ClassicSimilarity], result of:
      0.061915714 = score(doc=4819,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.2787029 = fieldWeight in 4819, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.0625 = fieldNorm(doc=4819)
  0.25 = coord(1/4)

Abstract

This anthology is the first systematic introduction to the subject. 15 chapters by leading software agent researchers provide complementary coverage of the relevant issues. Multiagent systems and mobile agent approaches are presented in a well-balanced way and applied to the most important topic in future communication systems. In addition, the volume editors have provided a detailed introductory chapter

0.015478929 = product of:
  0.061915714 = sum of:
    0.061915714 = weight(_text_:have in 4938) [ClassicSimilarity], result of:
      0.061915714 = score(doc=4938,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.2787029 = fieldWeight in 4938, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.0625 = fieldNorm(doc=4938)
  0.25 = coord(1/4)

Abstract

Introduces the InfoFinder agent, which uses innovative approaches for learning user information interests from sets of messages or other online documents that users have classified. It learns general profiles from documents by heuristically extracting phrases that are likely to represent the document's topis

0.015316567 = product of:
  0.06126627 = sum of:
    0.06126627 = weight(_text_:und in 6530) [ClassicSimilarity], result of:
      0.06126627 = score(doc=6530,freq=8.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.39207286 = fieldWeight in 6530, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0625 = fieldNorm(doc=6530)
  0.25 = coord(1/4)

Abstract

Sie rasen wie gestört durchs Netz, klicken aus alles, was sich bewegt, merken sich jeden noch so unwichtigen Blödsinn - und sind damit zum wichtigsten und zugleich umstrittensten Stückchen Software im Internet geworden: die sog. Crawlers, Robots, Spiders, Worms und Ants

Content

Beitrag zu den verschiedenen search engines des Internet mit Erläuterung der 'META-Tags' im HEAD-Bereich von HTML-Dokumenten: <META name="description" content="..."> ("..." nicht länger als 200 Zeichen) und <META name="keywords" content="..."> ("..." als Komma separierte Stichwortliste, die nicht länger als 1000 Zeichen sein soll)

0.013544062 = product of:
  0.05417625 = sum of:
    0.05417625 = weight(_text_:have in 4834) [ClassicSimilarity], result of:
      0.05417625 = score(doc=4834,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.24386504 = fieldWeight in 4834, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4834)
  0.25 = coord(1/4)

Abstract

Offers brief accounts of Internet search tools. Covers the Lycos revamp; the new navigation service produced jointly by Excite and Netscape, delivering a language specific, locally relevant Web guide for Japan, Germany, France, the UK and Australia; InfoWatcher, a combination offline browser, search engine and push product from Carvelle Inc., USA; Alexa by Alexa Internet and WBI from IBM which are free and provide users with information on how others have used the Web sites which they are visiting; and Concept Explorer from Knowledge Discovery Systems, Inc., California which performs data mining from the Web, Usenet groups, MEDLINE and the US Patent and Trademark Office patent abstracts

0.013538062 = product of:
  0.054152247 = sum of:
    0.054152247 = weight(_text_:und in 4567) [ClassicSimilarity], result of:
      0.054152247 = score(doc=4567,freq=4.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.34654674 = fieldWeight in 4567, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.078125 = fieldNorm(doc=4567)
  0.25 = coord(1/4)

Abstract

Die Spezial-CD, mit der Sie jetzt blitzschnell und treffsicher durch das Net surfen: Hier finden Sie alle Tricks, wie Sie mit intelligenten Suchsystemen, den 'Robots', 'Wanderers', 'Worms' oder 'Spiders', Millionen von Web-Seiten durchsuchen und sofort zur richtigen Fundstelle kommen

0.012843332 = product of:
  0.05137333 = sum of:
    0.05137333 = weight(_text_:und in 3319) [ClassicSimilarity], result of:
      0.05137333 = score(doc=3319,freq=10.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.3287631 = fieldWeight in 3319, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=3319)
  0.25 = coord(1/4)

Abstract

Browsing-Assistenten setzen dort an, wo konventionelle Suchmaschinen an ihre Grenzen stoßen. Soe personalisieren Hypertext abgestimmt auf Interessen und Vorlieben eines Benutzers und unterstützen ihn so auch bei Arten von Informationssuche, die von Suchmaschinen nur unzureichend abgedeckt werden. Dies sind insbesondere Situationen, in denen das Suchziel apriori nicht genau definiert ist oder sich nur schwer formulieren läßt. Dieser Beitrag gliedert bestehende Ansätze und Ideen zu Browsing-Assistenten, wobei 2 Systeme - WebWatcher und Personal WebWatcher - genauer betrachtet werden

0.011609196 = product of:
  0.046436783 = sum of:
    0.046436783 = weight(_text_:have in 522) [ClassicSimilarity], result of:
      0.046436783 = score(doc=522,freq=2.0), product of:
        0.22215667 = queryWeight, product of:
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.07045517 = queryNorm
        0.20902719 = fieldWeight in 522, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.1531634 = idf(docFreq=5157, maxDocs=44421)
          0.046875 = fieldNorm(doc=522)
  0.25 = coord(1/4)

Abstract

A novel idea of media agent is briefly presented, which can automatically build a personalized semantic index of Web media objects for each particular user. Because the Web is a rich source of multimedia data and the text content on the Web pages is usually semantically related to those media objects on the same pages, the media agent can automatically collect the URLs and related text, and then build the index of the multimedia data, on behalf of the user whenever and wherever she accesses these multimedia data or their container Web pages. Moreover, the media agent can also use an off-line crawler to build the index for those multimedia objects that are relevant to the user's favorites but have not accessed by the user yet. When the user wants to find these multimedia data once again, the semantic index facilitates text-based search for her.

0.011487424 = product of:
  0.045949697 = sum of:
    0.045949697 = weight(_text_:und in 4906) [ClassicSimilarity], result of:
      0.045949697 = score(doc=4906,freq=2.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.29405463 = fieldWeight in 4906, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.09375 = fieldNorm(doc=4906)
  0.25 = coord(1/4)

0.009572854 = product of:
  0.038291417 = sum of:
    0.038291417 = weight(_text_:und in 2256) [ClassicSimilarity], result of:
      0.038291417 = score(doc=2256,freq=2.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.24504554 = fieldWeight in 2256, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.078125 = fieldNorm(doc=2256)
  0.25 = coord(1/4)

Abstract

Intelligent Agents - ein Begriff, der bei vielen Web-Surfern für glänzende Augen sorgt. Welche Technologien gibt es und für was setzt man sie gezielt ein?

0.009572854 = product of:
  0.038291417 = sum of:
    0.038291417 = weight(_text_:und in 5445) [ClassicSimilarity], result of:
      0.038291417 = score(doc=5445,freq=2.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.24504554 = fieldWeight in 5445, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.078125 = fieldNorm(doc=5445)
  0.25 = coord(1/4)

Abstract

Es gibt eine Reihe von Tools, die ähnliche und meist sogar mehr Aufgaben übernehmen wie Metasuchmaschinen. Wir stellen Ihnen vier der Besten vor

0.009476642 = product of:
  0.03790657 = sum of:
    0.03790657 = weight(_text_:und in 734) [ClassicSimilarity], result of:
      0.03790657 = score(doc=734,freq=4.0), product of:
        0.15626246 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.07045517 = queryNorm
        0.24258271 = fieldWeight in 734, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=734)
  0.25 = coord(1/4)

Abstract

Der klassische Agent arbeitet für andere, hat selbst jedoch einen großen Entscheidungsspielraum. software-Agenten, eine Entwicklung der Künstlichen Intelligenz-Forschung, sind ähnlich gestrickt: Sie bekommen nur ihr Ziel gesagt, den Weg dorthin suchen sie selbständig. In Informationsnetzwerken werden sie bereits routinemäßig eingesetzt, um im Internet nach Informationen zu suchen, in großen Unternehmen Telefongespräche zu vermitteln oder in Banken die Bonität unbekannter Kunden zu prüfen. Derzeit enwickeln weltweit über 40 Unternehmen kommerzielle Agentensoftware, das Marktvolumen lag nach Schätzung des Marktforschungszentrums Ovum im Jahr 2000 bei 4 Milliarden US-Dollar. In Zukunft werden Software-Agenten nach Ansicht der Experten auch die Maschinensteuerung revolutionieren: Die Programme verbessern die Flexibilität von Service- und Industrierobotern und machen aus den bisher recht unflexiblen Blech-Gesellen "technische Agenten"