Sciweavers

1332 search results - page 95 / 267
» Combinatorial Algorithms
Sort
View
IPL
2008
135views more  IPL 2008»
13 years 9 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
IWANN
2001
Springer
14 years 1 months ago
A New Approach to Evolutionary Computation: Segregative Genetic Algorithms (SEGA)
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
Michael Affenzeller
EJC
2008
13 years 9 months ago
Pooling spaces associated with finite geometry
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
Tayuan Huang, Kaishun Wang, Chih-wen Weng
IEAAIE
1994
Springer
14 years 1 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
JCSS
2008
138views more  JCSS 2008»
13 years 9 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...