1002 search results - page 133 / 201 » Towards Graph Programs for Graph Algorithms |
147
click to vote
DIALM
2005
ACM
15 years 4 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
130
click to vote
IWOMP
2007
Springer
15 years 8 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
111
click to vote
AUSAI
2005
Springer
15 years 8 months ago
2005
Springer
The key problem in applying verification techniques such as model checking to agent architectures is to show how to map systematically from an agent program to a model structure t...
112
click to vote
VISUALIZATION
2000
IEEE
15 years 6 months ago
2000
IEEE
We present a new approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that,...
110
click to vote
DAC
1996
ACM
15 years 6 months ago
1996
ACM
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...