Sciweavers

565 search results - page 106 / 113
» Geometry of Upper Probabilities
Sort
View
SAGA
2009
Springer
14 years 4 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
FOCS
2008
IEEE
14 years 4 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
HICSS
2007
IEEE
100views Biometrics» more  HICSS 2007»
14 years 4 months ago
Performance Analysis of a Middleware Demultiplexing Pattern
A key enabler of the recently adopted, assemblycentric development approach for distributed real-time software systems is QoS-enabled middleware, which provides reusable building ...
U. Praphamontripong, Swapna S. Gokhale, Aniruddha ...
ICDM
2007
IEEE
183views Data Mining» more  ICDM 2007»
14 years 4 months ago
Depth-Based Novelty Detection and Its Application to Taxonomic Research
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
Yixin Chen, Henry L. Bart Jr., Xin Dang, Hanxiang ...
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami