Sciweavers

511 search results - page 66 / 103
» Lower bounds for distributed markov chain problems
Sort
View
IOR
2011
96views more  IOR 2011»
13 years 2 months ago
On the Minimax Complexity of Pricing in a Changing Environment
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
Omar Besbes, Assaf J. Zeevi
WG
1999
Springer
14 years 2 days ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
SPAA
2009
ACM
14 years 5 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 12 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
ICASSP
2008
IEEE
14 years 2 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries