Sciweavers

719 search results - page 24 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
WISE
2009
Springer
15 years 4 months ago
STC+ and NM-STC: Two Novel Online Results Clustering Methods for Web Searching
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
Stella Kopidaki, Panagiotis Papadakos, Yannis Tzit...
WWW
2003
ACM
15 years 10 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena
95
Voted
JUCS
2008
177views more  JUCS 2008»
14 years 9 months ago
An Improved Multi-Agent Simulation Methodology for Modelling and Evaluating Wireless Communication Systems Resource Allocation A
: Multi-Agent Systems (MAS) constitute a well known approach in modelling dynamical real world systems. Recently, this technology has been applied to Wireless Communication Systems...
P. M. Papazoglou, Dimitris A. Karras, Rallis C. Pa...
CP
2006
Springer
15 years 1 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
IPPS
2008
IEEE
15 years 4 months ago
An effective pointer replication algorithm in P2P networks
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
Jian Zhou, Laxmi N. Bhuyan, Anirban Banerjee