Sciweavers

1480 search results - page 216 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
15 years 1 months ago
Closed-loop optimal experiment design: The partial correlation approach
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
Roland Hildebrand, Michel Gevers, Gabriel Solari
EOR
2011
134views more  EOR 2011»
15 years 1 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
16 years 6 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
INFOCOM
2007
IEEE
16 years 22 days ago
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
Chee-Wei Tan, Daniel Pérez Palomar, Mung Ch...