50 search results - page 8 / 10 » On Unconstrained Quasi-Submodular Function Optimization |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
CAIP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. Many classes of images exhibit sparse structuring of statistical dependency. Each variable has strong statistical dependency with a small number of other variables and ne...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...