400 search results - page 4 / 80 » Hard Problem Generation for MKP |
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
AAAI
2000
15 years 1 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
106
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
124
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
EOR
2007
2007
Solving the short-term electrical generation scheduling problem by an adaptive evolutionary approach
14 years 11 months ago
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...