5153 search results - page 574 / 1031 » Introduction to Randomized Algorithms |
168
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
163
click to vote
SAGA
2001
Springer
15 years 11 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
146
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
162
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
179
Voted
ICSAP
2010
15 years 8 months ago
2010
- This paper describes a novel algorithm designed for tamper proofing of 3D models. Fragile watermarking is a known technique for detecting location of tamper in the artwork. Howev...