Sciweavers

1631 search results - page 266 / 327
» Uniform Distributed Synthesis
Sort
View
COMGEO
2004
ACM
13 years 10 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
IJWGS
2007
118views more  IJWGS 2007»
13 years 9 months ago
Grid middleware in China
: Grids aim at constructing a virtual single image of heterogeneous resources and provide uniform interface for distributed internet applications. China also devotes much passion a...
Yongwei Wu, Chunming Hu, Li Zha, Song Wu
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 9 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
ML
2002
ACM
133views Machine Learning» more  ML 2002»
13 years 9 months ago
Finite-time Analysis of the Multiarmed Bandit Problem
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
Peter Auer, Nicolò Cesa-Bianchi, Paul Fisch...
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...