18306 search results - page 434 / 3662 » Algorithmics in Exponential Time |
204
Voted
FS
2010
15 years 6 months ago
2010
The aim of this paper is to investigate the properties of stochastic volatility models, and to discuss to what extent, and with regard to which models, properties of the classical...
178
Voted
IEEEHPCS
2010
15 years 6 months ago
2010
We analyze and present different strategies to adapt the load in transactional memory systems based on contention. Our experimental results show a substantial overall improvement ...
219
click to vote
PE
2010
Springer
15 years 6 months ago
2010
Springer
From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed worklo...
230
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
220
click to vote
CADE
2012
Springer
13 years 10 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...