Sciweavers

453 search results - page 2 / 91
» Tight bounds for the partial-sums problem
Sort
View

Publication
151views
12 years 6 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
ENDM
2010
73views more  ENDM 2010»
13 years 4 months ago
Recourse problem of the 2-stage robust location transportation problem
In this paper, we are interested in the recourse problem of the 2-stage robust location transportation problem. We propose a solution process using a mixed-integer formulation wit...
Virginie Gabrel, Cécile Murat, Nabila Remli...
DLT
2009
13 years 5 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos