Sciweavers

SOFSEM
2009
Springer
15 years 16 hour ago
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Taolue Chen, Wan Fokkink, Rob J. van Glabbeek
SOFSEM
2009
Springer
15 years 16 hour ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
SOFSEM
2009
Springer
15 years 16 hour ago
Conjunctive Grammars with Restricted Disjunction
Alexander Okhotin, Christian Reitwießner
SOFSEM
2009
Springer
15 years 16 hour ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
SOFSEM
2009
Springer
15 years 16 hour ago
Safe Reasoning with Logic LTS
Gerald Lüttgen, Walter Vogler