14649 search results - page 305 / 2930 » Principles of problem solving |
201
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
132
click to vote
4OR
2010
15 years 6 months ago
2010
This paper describes a Diversification-Driven Tabu Search (D2 TS) algorithm for solving unconstrained binary quadratic problems. D2 TS is dis
131
click to vote
EOR
2007
15 years 6 months ago
2007
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
159
click to vote
MP
2006
15 years 6 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
200
click to vote
MOC
2002
15 years 6 months ago
2002
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...