Sciweavers

187 search results - page 16 / 38
» Computing Special Values of Partial Zeta Functions
Sort
View
DB
2008
107views more  DB 2008»
14 years 9 months ago
Introducing function extraction into software testing
Software testing can benefit from technologies that enable evolution toward increased engineering discipline. In current practice, software developers lack practical means to dete...
Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevn...
83
Voted
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 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...
JCSS
2010
112views more  JCSS 2010»
14 years 8 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
MOBIHOC
2003
ACM
15 years 9 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
HASKELL
2005
ACM
15 years 3 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...