Sciweavers

2252 search results - page 403 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
INFOCOM
1999
IEEE
14 years 1 months ago
Scalable Flow Control for Multicast ABR Services
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Ka...
ATAL
2008
Springer
13 years 10 months ago
Trajectories of goods in distributed allocation
Distributed allocation mechanisms rely on the agents' autonomous (and supposedly rational) behaviour: states evolve as a result of agents contracting deals and exchanging res...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
AAAI
2010
13 years 10 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
ICML
2010
IEEE
13 years 10 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer