Sciweavers

2485 search results - page 246 / 497
» Time Bounded Frequency Computations
Sort
View
TRANSCI
2011
80views more  TRANSCI 2011»
13 years 3 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...
CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
14 years 2 months ago
On the Impossibility of Strong Encryption Over
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second on...
Raphael C.-W. Phan, Serge Vaudenay
GLOBECOM
2008
IEEE
14 years 2 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu
QEST
2006
IEEE
14 years 2 months ago
Limiting Behavior of Markov Chains with Eager Attractors
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
RTSS
2005
IEEE
14 years 1 months ago
Hierarchical Fixed Priority Pre-Emptive Scheduling
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
Robert I. Davis, Alan Burns