Sciweavers

3475 search results - page 280 / 695
» Backbones in Optimization and Approximation
Sort
View
TMC
2012
13 years 9 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
ATAL
2007
Springer
16 years 23 days ago
Implementing the maximum of monotone algorithms
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
Liad Blumrosen
LATIN
2004
Springer
15 years 12 months ago
Rotation and Lighting Invariant Template Matching
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
COLT
2003
Springer
15 years 11 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
15 years 10 months ago
Multiline Addressing by Network Flow
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...