832 search results - page 156 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
ECEASST
2006
14 years 9 months ago
2006
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
GRID
2004
Springer
15 years 3 months ago
2004
Springer
With the advent of Grid computing, more and more highend computational resources become available for use to a scientist. While this opens up new avenues for scientific research,...
SI3D
1995
ACM
15 years 1 months ago
1995
ACM
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
DEDS
2010
14 years 7 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
109
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...