Sciweavers

872 search results - page 134 / 175
» Extreme lower probabilities
Sort
View
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
14 years 10 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li
JCM
2010
126views more  JCM 2010»
14 years 10 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
JSAC
2010
86views more  JSAC 2010»
14 years 10 months ago
A randomized countermeasure against parasitic adversaries in wireless sensor networks
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
Panagiotis Papadimitratos, Jun Luo, Jean-Pierre Hu...
MSOM
2010
77views more  MSOM 2010»
14 years 10 months ago
To Wave or Not to Wave? Order Release Policies for Warehouses with an Automated Sorter
Wave-based release policies are prevalent in warehouses with an automated sorter, and take different forms depending on how much waves overlap and whether the sorter is split for...
Jérémie Gallien, Théophane We...
RSA
2010
99views more  RSA 2010»
14 years 10 months ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov