1254 search results - page 47 / 251 » Making Hard Problems Harder |
UAI
2008
13 years 9 months ago
2008
Planning can often be simplified by decomposing the task into smaller tasks arranged hierarchically. Charlin et al. [4] recently showed that the hierarchy discovery problem can be...
ICDCSW
2005
IEEE
14 years 1 months ago
2005
IEEE
  Content-based event matching is an important problem in large-scale event-based publish/subscribe systems. However, open questions remain in ...
PLILP
1992
Springer
13 years 11 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
ASIACRYPT
2004
Springer
14 years 1 months ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...
ISIPTA
2003
IEEE
14 years 29 days ago
2003
IEEE
The European call option prices have well-known formulae in the Cox-RossRubinstein model [2], depending on the volatility of the underlying asset. Nevertheless it is hard to give ...