3422 search results - page 514 / 685 » Random Subset Optimization |
140
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
138
click to vote
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
129
click to vote
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
151
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
145
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...