417 search results - page 37 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents a realization for the reliable and fast startup of distributed systems written in Erlang. The traditional startup provided by the Erlang/OTP library is sequenti...
ICCS
2001
Springer
14 years 3 months ago
2001
Springer
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
KR
2004
Springer
14 years 4 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
ENTCS
2006
13 years 11 months ago
2006
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
ICFP
2009
ACM
14 years 11 months ago
2009
ACM
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...