Sciweavers

9842 search results - page 1367 / 1969
» Problem complexity
Sort
View
FSS
2002
84views more  FSS 2002»
15 years 7 months ago
A possibilistic approach to selecting portfolios with highest utility score
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
Christer Carlsson, Robert Fullér, Pé...
207
Voted
INFORMS
1998
100views more  INFORMS 1998»
15 years 7 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
174
Voted
TCSV
2002
69views more  TCSV 2002»
15 years 7 months ago
Optimizing channel allocation in a unified video-on-demand system
Unified video-on-demand (UVoD) is a recently proposed architecture that integrates multicast transmission with unicast transmission to improve system efficiency. Streaming channels...
Jack Y. B. Lee
JUCS
2010
160views more  JUCS 2010»
15 years 5 months ago
LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
Pierre Châtel, Isis Truck, Jacques Malenfant
ECCC
2011
223views ECommerce» more  ECCC 2011»
15 years 2 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
« Prev « First page 1367 / 1969 Last » Next »