Sciweavers

4679 search results - page 88 / 936
» Modeling When Connections Are the Problem
Sort
View
170
Voted
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 4 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ACCESSNETS
2008
Springer
15 years 8 months ago
A Simulator of Periodically Switching Channels for Power Line Communications
An indoor power line is one of the most attractive media for in-home networks. However, there are many technical problems for achieving in-home power line communication (PLC) with ...
Taro Hayasaki, Daisuke Umehara, Satoshi Denno, Mas...
DISOPT
2010
138views more  DISOPT 2010»
15 years 1 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
GBRPR
2005
Springer
15 years 7 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
SIAMSC
2011
219views more  SIAMSC 2011»
14 years 8 months ago
Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
H. P. Flath, Lucas C. Wilcox, Volkan Akcelik, Judi...