191 search results - page 14 / 39 » The standing ovation problem |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
HM
2005
Springer
14 years 1 months ago
2005
Springer
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
VR
2003
IEEE
14 years 26 days ago
2003
IEEE
The so-called “blue-c” is a novel three sided immersive projection system, which has been especially designed to support telecollaborative teamwork [4]. Therefore, special pro...