Sciweavers

62 search results - page 7 / 13
» A genetic algorithm encoding for a class of cardinality cons...
Sort
View
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
13 years 8 months ago
Non-negative matrix factorisation for object class discovery and image auto-annotation
In information retrieval, sub-space techniques are usually used to reveal the latent semantic structure of a data-set by projecting it to a low dimensional space. Non-negative mat...
Jiayu Tang, Paul H. Lewis
AI
2000
Springer
13 years 6 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
CEC
2007
IEEE
14 years 1 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
EC
2007
160views ECommerce» more  EC 2007»
13 years 6 months ago
Agent-Based Model of Genotype Editing
Evolutionary algorithms rarely deal with ontogenetic, non-inherited alteration of genetic information because they are based on a direct genotype-phenotype mapping. In contrast, i...
Chien-Feng Huang, Jasleen Kaur, Ana Gabriela Magui...
FOCS
2008
IEEE
14 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...