1018 search results - page 94 / 204 » Generative unbinding of names |
99
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
112
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
100
click to vote
CORR
2006
Springer
15 years 22 days ago
2006
Springer
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
COR
2007
15 years 21 days ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
101
Voted
ITSSA
2006
15 years 21 days ago
2006
: Modern information systems are becoming more and more socio-technical systems, namely systems composed of human (social) agents and software (technical) systems operating togethe...