Neuware - This book frames a peer-to-peer information retrievalproblem as a multi-agent framework and attacks itfrom an organizational perspective by exploringvarious adaptive, self-organizing topologicalorganizations, designing appropriatecoordination strategies, and exploiting learningtechniques to create more accurate routing policy forlarge-scale agent organizations. In addition, areinforcement-learning based approach is developed inthis thesis to take advantage of the run-timecharacteristics of P2P IR systems, includingenvironmental parameters, bandwidth usage, andhistorical information about past search sessions. Inthe learning process, agents refine their contentrouting policies by constructing relatively accuraterouting tables based on a Q-learning algorithm.Experimental results show that this learningalgorithm considerably improves the performance ofdistributed search sessions in P2P IR systems.The book is addressed to researchers andpractitioners in information retrieval and searchengine, content-based routing areas.

N� de ref. del art�culo 9783639084795

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Toward Peer-to-Peer Based Semantic Search Engines : An Organizational Approach
Editor: VDM Verlag Dr. M�ller, VDM Verlag Dr. M�ller E.K.
Fecha de publicaci�n: 2008
Idioma: Ingl�s
ISBN 10: 3639084799
ISBN 13: 9783639084795
Encuadernaci�n: Taschenbuch
Estado: Neu

Acerca de

Sinopsis

This book frames a peer-to-peer information retrieval problem as a multi-agent framework and attacks it from an organizational perspective by exploring various adaptive, self-organizing topological organizations, designing appropriate coordination strategies, and exploiting learning techniques to create more accurate routing policy for large-scale agent organizations. In addition, a reinforcement-learning based approach is developed in this thesis to take advantage of the run-time characteristics of P2P IR systems, including environmental parameters, bandwidth usage, and historical information about past search sessions. In the learning process, agents refine their content routing policies by constructing relatively accurate routing tables based on a Q-learning algorithm. Experimental results show that this learning algorithm considerably improves the performance of distributed search sessions in P2P IR systems. The book is addressed to researchers and practitioners in information retrieval and search engine, content-based routing areas.

Rese�a del editor

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.

Descripci�n de la librer�a

Das Unternehmen AHA-BUCH GmbH: Seit der Gr�ndung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisg�nstig wie m�glich ihren B�cherwunsch zu erf�llen. Unsere Firma besch�ftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine W�nsche! Auf �ber 3700 m2 Fl�che haben wir �ber 100.000 B�cher, Modernes Antiquariat und Spiele auf Lager.

Ver la p�gina web de la librer�a

Informaci�n empresarial del vendedor

AHA-BUCH GmbH
Garlebsen 48, Einbeck, 37574, Germany

Condiciones de venta y env�o

Condiciones de venta

T�rminos y Condiciones Generales e Informaci�n del Cliente / Pol�tica de Privacidad

I. T�rminos y Condiciones Generales

� 1 Disposiciones b�sicas

(1)Los siguientes t�rminos y condiciones se aplican a todos los contratos que celebre con nosotros como proveedor (AHA-BUCH GmbH) a trav�s de las plataformas de Internet AbeBooks y/o ZVAB. A menos que se acuerde lo contrario, se objetar� la inclusi�n de cualquiera de sus propios t�rminos y condiciones utilizados por usted.
(2)Un consumidor en el sentid...

M�s informaci�n

Condiciones de env�o

Enviamos su pedido despu�s de recibirlos
para art�culos disponibles las �ltimas 24 horas,
para art�culos con suministro nocturno a m�s tardar 48 horas.
En caso de que necesitemos pedir un art�culo a nuestro proveedor, nuestro tiempo de env�o depende de la fecha de recepci�n de los art�culos, pero los art�culos se enviar�n el mismo d�a.

Nuestro objetivo es enviar los art�culos pedidos de la manera m�s r�pida, pero tambi�n m�s eficiente y segura a nuestros clientes.

Informaci�n detallada sobre el vendedor