291 search results - page 3 / 59 » On Generalizing Pawlak Approximation Operators |
ATMOS
2007
13 years 9 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
ANCS
2010
ACM
13 years 4 months ago
2010
ACM
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
JMLR
2012
11 years 10 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
— Quantiles are very useful in characterizing the data distribution of an evolving dataset in the process of data mining or network monitoring. The method of Stochastic Approxima...