1002 search results - page 122 / 201 » Towards Graph Programs for Graph Algorithms |
123
Voted
AAMAS
2002
Springer
15 years 2 months ago
2002
Springer
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support eff...
132
click to vote
INFORMATICALT
2007
15 years 2 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
130
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
116
click to vote
ICLP
2005
Springer
15 years 8 months ago
2005
Springer
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
135
click to vote
GD
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...