Sciweavers

1548 search results - page 74 / 310
» Computational Approaches to Sentence Completion
Sort
View
DSN
2002
IEEE
15 years 11 months ago
Generic Timing Fault Tolerance using a Timely Computing Base
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
Antonio Casimiro, Paulo Veríssimo
AAAI
2008
15 years 8 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
CORR
2011
Springer
206views Education» more  CORR 2011»
15 years 1 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
IPPS
2007
IEEE
16 years 13 days ago
Prediction Services for Distributed Computing
Users of distributed systems such as the TeraGrid and Open Science Grid can execute their applications on many different systems. We wish to help such users, or the grid scheduler...
Warren Smith
ICSOC
2007
Springer
16 years 9 days ago
Towards Self-management in Service-Oriented Computing with Modes
Abstract. A self-managed system is both self-assembling and selfhealing. Service-oriented Computing (SoC) architectures, such as a Web Services Architecture (WS-A) illustrate a hig...
Howard Foster, Sebastián Uchitel, Jeff Kram...