1041 search results - page 64 / 209 » Randomizing Reductions of Search Problems |
FLAIRS
2007
13 years 10 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
EOR
2008
13 years 8 months ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
ICPR
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we propose a learning-based method for video super-resolution. There are two main contributions of the proposed method. First, information from cameras with differe...
IJCAI
2003
13 years 9 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
EUROCRYPT
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...