400 search results - page 10 / 80 » Hard Problem Generation for MKP |
COLING
1990
13 years 8 months ago
1990
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
CLOUDCOM
2010
Springer
13 years 5 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
FORTE
2008
13 years 8 months ago
2008
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...
HEURISTICS
2010
13 years 2 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...