6 search results - page 1 / 2 » Solving Hard Satisfiability Problems: A Unified Algorithm Ba... |
ICTAI
1999
IEEE
13 years 9 months ago
1999
IEEE
CP
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
AI
2000
Springer
13 years 4 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
ICTAI
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
INDOCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...