Sciweavers

2661 search results - page 235 / 533
» Quantum Complexity Classes
Sort
View
QEST
2006
IEEE
15 years 10 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
VTC
2006
IEEE
121views Communications» more  VTC 2006»
15 years 10 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer
ISAAC
2005
Springer
104views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Network Load Games
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
Ioannis Caragiannis, Clemente Galdi, Christos Kakl...
MFCS
2005
Springer
15 years 9 months ago
On Small Hard Leaf Languages
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ...
Falk Unger
MYCRYPT
2005
Springer
187views Cryptology» more  MYCRYPT 2005»
15 years 9 months ago
Distinguishing Attacks on T-Functions
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function an...
Simon Künzli 0002, Pascal Junod, Willi Meier