Sciweavers

916 search results - page 121 / 184
» Using redundancies to find errors
Sort
View
AAAI
2008
15 years 5 months ago
A Meta-Programming Technique for Debugging Answer-Set Programs
Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs....
Martin Gebser, Jörg Pührer, Torsten Scha...
116
Voted
ACL
2004
15 years 5 months ago
Deep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
Roger Levy, Christopher D. Manning
112
Voted
ECIS
2004
15 years 5 months ago
Open University vs. Consorzio Nettuno: an institutional analysis of two techonology enabled higher educational systems
Assuming a rational perspective, the adoption and development of a new organisational technology can be viewed as a way to achieve an higher level of efficiency by finding the bes...
Flavia Blumetti, Paolo Ferri, Cristiano Ghiringhel...
123
Voted
ISCAPDCS
2003
15 years 5 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
122
Voted
CORR
2006
Springer
120views Education» more  CORR 2006»
15 years 3 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth