Sciweavers

698 search results - page 30 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
14 years 6 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
DAGSTUHL
2004
13 years 10 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
FSTTCS
2010
Springer
13 years 7 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 6 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
COCOON
1998
Springer
14 years 1 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer