Sciweavers

2477 search results - page 104 / 496
» Approximate extended formulations
Sort
View
126
Voted
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 8 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi
ICASSP
2010
IEEE
15 years 4 months ago
Acceleration of sequence kernel computation for real-time speaker identification
The sequence kernel has been shown to be a promising kernel function for learning from sequential data such as speech and DNA. However, it is not scalable to massive datasets due ...
Makoto Yamada, Masashi Sugiyama, Gordon Wichern, T...
EOR
2006
90views more  EOR 2006»
15 years 4 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
CN
2002
102views more  CN 2002»
15 years 3 months ago
On the impact of soft handoff in cellular systems
We present a model for soft handoff in wireless cellular networks. In such networks, due to overlapping cells, handoffs are not instantaneous and multiple channels may be occupied...
Nidhi Hegde, Khosrow Sohraby
DAM
1999
132views more  DAM 1999»
15 years 3 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian