Sciweavers

627 search results - page 123 / 126
» Kolmogorov-Loveland Randomness and Stochasticity
Sort
View
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 8 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»
13 years 7 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»
13 years 7 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...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Noncooperative power control and transmission scheduling in wireless collision channels
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station using a random access protocol. Mobiles are selfoptimizin...
Ishai Menache, Nahum Shimkin
SIGMETRICS
2008
ACM
121views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems
Two schemes proposed to cope with unrecoverable or latent media errors and enhance the reliability of RAID systems are examined. The first scheme is the established, widely used d...
Ilias Iliadis, Robert Haas, Xiao-Yu Hu, Evangelos ...