Sciweavers

11565 search results - page 1979 / 2313
» Computing Minimal Mappings
Sort
View
CONCURRENCY
2008
95views more  CONCURRENCY 2008»
15 years 6 months ago
The File Mover: high-performance data transfer for the grid
The exploration in many scientific disciplines (e.g., High-Energy Physics, Climate Modeling, and Life Sciences) involves the production and the analysis of massive data collection...
Cosimo Anglano, Massimo Canonico
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
One shot schemes for decentralized quickest change detection
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
Olympia Hadjiliadis, Hongzhong Zhang, H. Vincent P...
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 6 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 6 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
191
Voted
DISOPT
2010
138views more  DISOPT 2010»
15 years 6 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...
« Prev « First page 1979 / 2313 Last » Next »