Sciweavers

698 search results - page 41 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 2 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
ICASSP
2011
IEEE
13 years 1 months ago
A Kalman-like algorithm with no requirements for noise and initial conditions
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...
Yuriy S. Shmaliy
PODC
1999
ACM
14 years 1 months ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
STACS
2005
Springer
14 years 2 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning