3628 search results - page 152 / 726 » The Decision Diffie-Hellman Problem |
ICAC
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of localizing network performance bottlenecks and evaluate how various optimization techniques developed for reconstructing link delays perform on this dec...
AAAI
2008
14 years 2 hour ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Real-word applications often involve a binary hypothesis testing problem with one of the two hypotheses ill-defined and hard to be characterized precisely by a single measure. In ...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
WG
1998
Springer
14 years 1 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....