Sciweavers

1080 search results - page 93 / 216
» Problem dependent optimization (PDO)
Sort
View
RTS
2000
143views more  RTS 2000»
15 years 4 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
IEAAIE
2010
Springer
15 years 2 months ago
Constructive Neural Networks to Predict Breast Cancer Outcome by Using Gene Expression Profiles
Abstract. Gene expression profiling strategies have attracted considerable interest from biologist due to the potential for high throughput analysis of hundreds of thousands of gen...
Daniel Urda, José Luis Subirats, Leonardo F...
SIAMSC
2011
162views more  SIAMSC 2011»
14 years 11 months ago
Accelerating the LSTRS Algorithm
In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solving the Large-Scale Trust-Region Subproblem was suggested which is based on ...
Jörg Lampe, Marielba Rojas, Danny C. Sorensen...
COLT
2000
Springer
15 years 8 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon