42230 search results - page 154 / 8446 » Algorithms and Complexity Results for |
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
CHES
2000
Springer
15 years 2 months ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
ACG
2003
Springer
15 years 1 months ago
2003
Springer
ProbCut is a selective-search enhancement to the standard alpha
DCG
2010
14 years 10 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
TCS
2010
14 years 8 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...