Sciweavers

1416 search results - page 233 / 284
» cost 2009
Sort
View
SAGA
2009
Springer
14 years 3 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ICFP
2009
ACM
14 years 9 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
14 years 3 months ago
Active Learning with Generalized Queries
—Active learning can actively select or construct examples to label to reduce the number of labeled examples needed for building accurate classifiers. However, previous works of...
Jun Du, Charles X. Ling
ICCV
2009
IEEE
15 years 1 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
KBSE
2009
IEEE
14 years 3 months ago
A Case for Automated Debugging Using Data Structure Repair
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
Muhammad Zubair Malik, Khalid Ghori, Bassem Elkara...