Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJanuary 2013
On the possibilities and limitations of pseudodeterministic algorithms
ITCS '13: Proceedings of the 4th conference on Innovations in Theoretical Computer SciencePages 127–138https://doi.org/10.1145/2422436.2422453We study the possibilities and limitations of pseudodeterministic algorithms, algorithms, a notion put forward by Gat and Goldwasser (2011). These are probabilistic algorithms that solve search problems such that on each input, with high probability, ...
- articleJanuary 2006
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL), Volume 7, Issue 1Pages 38–83https://doi.org/10.1145/1119439.1119441The answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a logic theory so that models of this theory represent problem solutions. To compute a solution to the problem, ...
- ArticleMay 1996
The program understanding problem: analysis and a heuristic approach
Program understanding is the process of making sense of a complex source code. This process has been considered as computationally difficult and conceptually complex. So far no formal complexity results have been presented, and conceptual models differ ...
- ArticleSeptember 1995
An exact methodology for scheduling in a 3D design space
ISSS '95: Proceedings of the 8th international symposium on System synthesisPages 78–83https://doi.org/10.1145/224486.224505Abstract: This paper describes an exact solution methodology, implemented in Rensselaer's Voyager design space exploration system, for solving the scheduling problem in a 3-dimensional (3D) design space: the usual 2D design space (which trades off area ...