Sciweavers

721 search results - page 14 / 145
» On Generators of Random Quasigroup Problems
Sort
View
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
14 years 2 months ago
Vertex Cover Approximations on Random Graphs
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...
Eyjolfur Asgeirsson, Clifford Stein
IJON
2010
199views more  IJON 2010»
13 years 5 months ago
DFS-generated pathways in GA crossover for protein structure prediction
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul ...
CP
2006
Springer
13 years 11 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
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...
Vibhav Gogate, Rina Dechter
EOR
2007
163views more  EOR 2007»
13 years 7 months ago
The multi-depot vehicle routing problem with inter-depot routes
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...
Benoit Crevier, Jean-François Cordeau, Gilb...
JCS
2011
156views more  JCS 2011»
13 years 2 months ago
Securing low-cost RFID systems: An unconditionally secure approach
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...
Basel Alomair, Loukas Lazos, Radha Poovendran