Sciweavers

1612 search results - page 145 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
FOCS
2000
IEEE
15 years 8 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
159
Voted
SAC
2011
ACM
15 years 1 days ago
Stochastic matching pursuit for Bayesian variable selection
This article proposes a stochastic version of the matching pursuit algorithm for Bayesian variable selection in linear regression. In the Bayesian formulation, the prior distributi...
Ray-Bing Chen, Chi-Hsiang Chu, Te-You Lai, Ying Ni...
137
Voted
APIN
2007
118views more  APIN 2007»
15 years 5 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
INFOCOM
2003
IEEE
15 years 10 months ago
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
— A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data ...
Seema Bandyopadhyay, Edward J. Coyle
157
Voted
STACS
2005
Springer
15 years 10 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...