1002 search results - page 86 / 201 » Towards Graph Programs for Graph Algorithms |
132
click to vote
VL
2010
IEEE
15 years 27 days ago
2010
IEEE
Visual programming languages can be used to make computer science more accessible to a broad range of students. The evaluative focus of current research in the area of visual lang...
129
Voted
AGTIVE
2003
Springer
15 years 7 months ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
128
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
109
click to vote
SC
1995
ACM
15 years 6 months ago
1995
ACM
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
123
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...