Sciweavers

99 search results - page 19 / 20
» On a class of finite symmetric graphs
Sort
View
LICS
1997
IEEE
13 years 12 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
FORMATS
2008
Springer
13 years 10 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
TASE
2007
IEEE
14 years 2 months ago
Symmetry Reduced Model Checking for B
Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (or...
Edd Turner, Michael Leuschel, Corinna Spermann, Mi...
IPPS
2000
IEEE
14 years 24 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
TSP
2010
13 years 3 months ago
Statistics of Co-Channel Interference in a Field of Poisson and Poisson-Poisson Clustered Interferers
Abstract--With increasing spatial reuse of radio spectrum, cochannel interference is becoming a dominant noise source and may severely degrade the communication performance of wire...
Kapil Gulati, Brian L. Evans, Jeffrey G. Andrews, ...