1002 search results - page 78 / 201 » Towards Graph Programs for Graph Algorithms |
188
click to vote
AMAI
1999
Springer
15 years 4 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
162
click to vote
WAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...
126
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
137
Voted
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
4 Automatic diļ¬erentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
131
Voted
CSR
2008
Springer
15 years 6 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...