51 search results - page 7 / 11 » Iterative construction of the optimal Bermudan stopping time |
FOCS
1999
IEEE
14 years 22 days ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
ESTIMEDIA
2006
Springer
14 years 2 days ago
2006
Springer
This paper presents the influence of the loop nest splitting source code optimization on the worst-case execution time (WCET). Loop nest splitting minimizes the number of executed...
VIS
2004
IEEE
14 years 9 months ago
2004
IEEE
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
KR
1989
Springer
14 years 14 days ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...