Sciweavers

447 search results - page 18 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
WSC
2008
13 years 9 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi
ECCC
2011
234views ECommerce» more  ECCC 2011»
13 years 2 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
MOR
2006
95views more  MOR 2006»
13 years 7 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege

Publication
222views
14 years 4 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda