Sciweavers

12519 search results - page 2304 / 2504
» Approximation Problems Categories
Sort
View
SAC
2010
ACM
15 years 11 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
SAC
2010
ACM
15 years 11 months ago
Trustworthy interaction balancing in mixed service-oriented systems
Web-based collaboration systems typically require dynamic and context-based interactions between people and services. To support such complex interaction scenarios, we introduce a...
Florian Skopik, Daniel Schall, Schahram Dustdar
WSDM
2010
ACM
197views Data Mining» more  WSDM 2010»
15 years 11 months ago
Beyond DCG: user behavior as a predictor of a successful search
Web search engines are traditionally evaluated in terms of the relevance of web pages to individual queries. However, relevance of web pages does not tell the complete picture, si...
Ahmed Hassan, Rosie Jones, Kristina Lisa Klinkner
HYBRID
2010
Springer
15 years 11 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
IPSN
2010
Springer
15 years 11 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
« Prev « First page 2304 / 2504 Last » Next »