Sciweavers

1184 search results - page 115 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
131
Voted
IAT
2005
IEEE
15 years 8 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni
144
Voted
RSP
2007
IEEE
143views Control Systems» more  RSP 2007»
15 years 9 months ago
Heuristics for Dynamic Task Mapping in NoC-based Heterogeneous MPSoCs
Multiprocessor Systems-on-Chip (MPSoCs) is a trend in VLSI design, since they minimize the “design crisis” (gap between silicon technology and actual SoC design capacity) and ...
Ewerson Carvalho, Ney Calazans, Fernando Moraes
139
Voted
JMLR
2010
155views more  JMLR 2010»
14 years 9 months ago
Structured Sparse Principal Component Analysis
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
Rodolphe Jenatton, Guillaume Obozinski, Francis Ba...
118
Voted
CORR
2008
Springer
113views Education» more  CORR 2008»
15 years 2 months ago
Robustness, Risk, and Regularization in Support Vector Machines
We consider two new formulations for classification problems in the spirit of support vector machines based on robust optimization. Our formulations are designed to build in prote...
Huan Xu, Shie Mannor, Constantine Caramanis
118
Voted
MP
2002
110views more  MP 2002»
15 years 2 months ago
Robust optimization - methodology and applications
Abstract. Robust Optimization (RO) is a modeling methodology, combined with computational tools, to process optimization problems in which the data are uncertain and is only known ...
Aharon Ben-Tal, Arkadi Nemirovski