2286 search results - page 132 / 458 » Algorithms for Categorical Equivalence |
SCP
2008
14 years 10 months ago
2008
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
ILP
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we study the generalization algorithms for second-order terms, which are treated as first-order terms with function variables, under an instantiation order denoted ...
ALT
2004
Springer
15 years 7 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...