— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...