Sciweavers

971 search results - page 60 / 195
» Approximate Satisfiability and Equivalence
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
LICS
2012
IEEE
12 years 11 days ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
ICFEM
2009
Springer
14 years 4 months ago
Circular Coinduction with Special Contexts
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
Dorel Lucanu, Grigore Rosu
PERCOM
2006
ACM
14 years 9 months ago
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
Christopher L. Barrett, V. S. Anil Kumar, Madhav V...
MOC
1998
94views more  MOC 1998»
13 years 9 months ago
Analysis of third-order methods for secular equations
Third-order numerical methods are analyzed for secular equations. These equations arise in several matrix problems and numerical linear algebra applications. A closer look at an ex...
A. Melman