8141 search results - page 1390 / 1629 » Higher Order Generalization |
111
click to vote
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
168
click to vote
ICALP
1993
Springer
15 years 8 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
164
click to vote
APN
1992
Springer
15 years 8 months ago
1992
Springer
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
123
click to vote
TAPSOFT
1993
Springer
15 years 8 months ago
1993
Springer
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
194
Voted
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...