721 search results - page 14 / 145 » On Generators of Random Quasigroup Problems |
154
click to vote
WEA
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
158
click to vote
IJON
2010
15 years 3 months ago
2010
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
169
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
128
click to vote
EOR
2007
15 years 5 months ago
2007
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
195
click to vote
JCS
2011
15 years 24 days ago
2011
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...