Sciweavers

612 search results - page 70 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
TCS
2010
13 years 6 months ago
Contract-based discovery of Web services modulo simple orchestrators
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
Luca Padovani
TDSC
2011
13 years 2 months ago
Application-Level Diagnostic and Membership Protocols for Generic Time-Triggered Systems
Abstract— We present on-line tunable diagnostic and membership protocols for generic time-triggered (TT) systems to detect crashes, send/receive omission faults and network parti...
Marco Serafini, Péter Bokor, Neeraj Suri, J...
DIS
2004
Springer
14 years 1 months ago
On the Convergence of Incremental Knowledge Base Construction.
Abstract. Ripple Down Rules is a practical methodology to build knowledgebased systems, which has proved successful in a wide range of commercial applications. However, little work...
Tri M. Cao, Eric Martin, Paul Compton
CADE
2007
Springer
14 years 8 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish
FOCS
2004
IEEE
13 years 11 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...