Sciweavers

26 search results - page 4 / 6
» Resource bounded and anytime approximation of belief functio...
Sort
View
WINE
2009
Springer
127views Economy» more  WINE 2009»
15 years 4 months ago
Nash Dynamics in Congestion Games with Similar Resources
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
AMAI
2004
Springer
15 years 2 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
15 years 1 months ago
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
Tanmoy Chakraborty, Sanjeev Khanna
CGF
1998
118views more  CGF 1998»
14 years 9 months ago
An Exhaustive Error-Bounding Algorithm for Hierarchical Radiosity
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...
Nicolas Holzschuch, François X. Sillion
IPPS
2009
IEEE
15 years 4 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram