Sciweavers

4435 search results - page 289 / 887
» Algorithms, games, and the internet
Sort
View
WOWMOM
2009
ACM
144views Multimedia» more  WOWMOM 2009»
16 years 1 months ago
A CARMEN mesh experience: deployment and results
When there is no wired connectivity, wireless mesh networks (WMNs) can provide Internet access with lower cost and greater flexibility than traditional approaches. This has motiv...
Pablo Serrano, Antonio de la Oliva, Carlos Jesus B...
PAAMS
2010
Springer
15 years 11 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
CORR
2007
Springer
73views Education» more  CORR 2007»
15 years 6 months ago
Universal Reinforcement Learning
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
Vivek F. Farias, Ciamac Cyrus Moallemi, Tsachy Wei...
IMC
2006
ACM
16 years 23 days ago
Rarest first and choke algorithms are enough
The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rare...
Arnaud Legout, Guillaume Urvoy-Keller, Pietro Mich...
WWW
2002
ACM
15 years 6 months ago
Improvement of HITS-based algorithms on web documents
In this paper, we present two ways to improve the precision of HITS-based algorithms on Web documents. First, by analyzing the limitations of current HITS-based algorithms, we pro...
Longzhuang Li, Yi Shang, Wei Zhang