Sciweavers

273 search results - page 9 / 55
» Problem formulation as the reduction of a decision model
Sort
View
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
14 years 2 months ago
A continuous time markov decision process based on-chip buffer allocation methodology
We have presented an optimal on-chip buffer allocation and buffer insertion methodology which uses stochastic models of the architecture. This methodology uses finite buffer s...
Sankalp Kallakuri, Nattawut Thepayasuwan, Alex Dob...
ECSQARU
2007
Springer
14 years 2 months ago
On Decision Support Under Risk by the WOWA Optimization
Abstract. The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuz...
Wlodzimierz Ogryczak, Tomasz Sliwinski
ANOR
2002
57views more  ANOR 2002»
13 years 8 months ago
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
Siqun Wang, Monique Guignard
CVPR
2008
IEEE
14 years 10 months ago
Dimensionality reduction by unsupervised regression
We consider the problem of dimensionality reduction, where given high-dimensional data we want to estimate two mappings: from high to low dimension (dimensionality reduction) and f...
Miguel Á. Carreira-Perpiñán, ...
AAAI
2010
13 years 10 months ago
Multi-Instance Dimensionality Reduction
Multi-instance learning deals with problems that treat bags of instances as training examples. In single-instance learning problems, dimensionality reduction is an essential step ...
Yu-Yin Sun, Michael K. Ng, Zhi-Hua Zhou