698 search results - page 30 / 140 » A Deterministic Algorithm for Solving Imprecise Decision Pro... |
114
Voted
SODA
2010
ACM
16 years 19 days ago
2010
ACM
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...
124
click to vote
DAGSTUHL
2004
15 years 4 months ago
2004
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...
111
click to vote
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
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 ...
141
Voted
SODA
2010
ACM
16 years 19 days ago
2010
ACM
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,...
102
Voted
COCOON
1998
Springer
15 years 7 months ago
1998
Springer
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...