Sciweavers

196 search results - page 15 / 40
» New Algorithms for Optimal Online Checkpointing
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
Ioannis A. Vetsikas, Alex Rogers, Nicholas R. Jenn...
BMCBI
2005
108views more  BMCBI 2005»
13 years 7 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
COCOON
2007
Springer
14 years 1 months ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 26 days ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 1 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga