465 search results - page 54 / 93 » Optimization Over the Efficient Set of Multi-objective Conve... |
KDD
2012
ACM
11 years 11 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
CDC
2008
IEEE
14 years 3 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...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider a financial decision problem involving dynamic investment decisions on a single risky instrument over multiple and discrete time periods. Investment returns are as...