Sciweavers

1298 search results - page 60 / 260
» The online set cover problem
Sort
View
ATMOS
2007
129views Optimization» more  ATMOS 2007»
14 years 11 months ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
IAT
2009
IEEE
15 years 1 months ago
On-line Coordination: Event Interaction and State Communication between Cooperative Agents
This paper addresses a novel coordination problem for distributed agents in a discrete-event setting. We introduce and study a predicate coordination problem as the problem of dist...
Manh Tung Pham, Kiam Tian Seow
ALT
2010
Springer
14 years 11 months ago
Optimal Online Prediction in Adversarial Environments
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
Peter L. Bartlett
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 5 days ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish