Sciweavers

518 search results - page 87 / 104
» Towards Distributed Algorithm Portfolios
Sort
View
INFOCOM
2000
IEEE
15 years 2 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
90
Voted
MM
2009
ACM
147views Multimedia» more  MM 2009»
15 years 4 months ago
Distribution-based concept selection for concept-based video retrieval
Query-to-concept mapping plays one of the keys to concept-based video retrieval. Conventional approaches try to find concepts that are likely to co-occur in the relevant shots fro...
Juan Cao, HongFang Jing, Chong-Wah Ngo, Yongdong Z...
CEC
2008
IEEE
15 years 4 months ago
NichingEDA: Utilizing the diversity inside a population of EDAs for continuous optimization
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...
Weishan Dong, Xin Yao
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
14 years 9 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 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