Sciweavers

2354 search results - page 396 / 471
» Randomness, Stochasticity and Approximations
Sort
View
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
15 years 7 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato
IOPADS
1997
152views more  IOPADS 1997»
15 years 7 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 7 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
ANOR
2008
69views more  ANOR 2008»
15 years 6 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
ALMOB
2006
155views more  ALMOB 2006»
15 years 5 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...