Sciweavers

1510 search results - page 88 / 302
» Upper Probabilities and Additivity
Sort
View
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
14 years 11 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
SIAMJO
2010
155views more  SIAMJO 2010»
14 years 4 months ago
Optimal Portfolio Execution Strategies and Sensitivity to Price Impact Parameters
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
Somayeh Moazeni, Thomas F. Coleman, Yuying Li
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
15 years 10 months ago
One-dimensional quantum walks
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absor...
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin V...
CLUSTER
2005
IEEE
15 years 3 months ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
CORR
2004
Springer
218views Education» more  CORR 2004»
14 years 9 months ago
A Dynamic Clustering-Based Markov Model for Web Usage Mining
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
José Borges, Mark Levene