1382 search results - page 53 / 277 » Formal Analysis of Online Algorithms |
163
Voted
FORMATS
2006
Springer
15 years 9 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
132
click to vote
ICDCSW
2005
IEEE
15 years 11 months ago
2005
IEEE
Content-based event matching is an important problem in large-scale event-based publish/subscribe systems. However, open questions remain in ...
166
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
170
click to vote
BCB
2010
15 years 25 days ago
2010
Biclustering is a very popular method to identify hidden co-regulation patterns among genes. There are numerous biclustering algorithms designed to undertake this challenging task...
168
click to vote
IBPRIA
2009
Springer
15 years 10 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...