Sciweavers

373 search results - page 48 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Fully decentralized emulation of best-effort and processor sharing queues
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
Rade Stanojevic, Robert Shorten
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
SC
2009
ACM
14 years 2 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
TEC
2011
134views more  TEC 2011»
13 years 2 months ago
Differential Evolution: A Survey of the State-of-the-Art
—Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational step...
Swagatam Das, Ponnuthurai Nagaratnam Suganthan
MM
2009
ACM
187views Multimedia» more  MM 2009»
14 years 19 days ago
Convex experimental design using manifold structure for image retrieval
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
Lijun Zhang, Chun Chen, Wei Chen, Jiajun Bu, Deng ...