Sciweavers

4679 search results - page 10 / 936
» Modeling When Connections Are the Problem
Sort
View
COLT
2008
Springer
14 years 11 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
ICA
2004
Springer
15 years 3 months ago
Estimating Functions for Blind Separation when Sources Have Variance-Dependencies
The blind separation problem where the sources are not independent, but have variance-dependencies is discussed. Hyv¨arinen and Hurri[1] proposed an algorithm which requires no as...
Motoaki Kawanabe, Klaus-Robert Müller
WSC
2001
14 years 11 months ago
Constrained Monte Carlo and the method of control variates
A constrained Monte Carlo problem arises when one computes an expectation in the presence of a priori computable constraints on the expectations of quantities that are correlated ...
Roberto Szechtman, Peter W. Glynn
INFOCOM
2007
IEEE
15 years 4 months ago
On the Routing Problem in Disconnected Vehicular Ad-hoc Networks
Abstract— Vehicular Ad Hoc Wireless Network (VANET) exhibits a bipolar behavior in terms of network topology: fully connected topology with high traffic volume or sparsely conne...
Nawaporn Wisitpongphan, Fan Bai, Priyantha Mudalig...
OPODIS
2008
14 years 11 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...