1002 search results - page 49 / 201 » Towards Graph Programs for Graph Algorithms |
195
click to vote
TAPAS
2011
14 years 9 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
SMC
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
109
click to vote
DSN
2000
IEEE
15 years 6 months ago
2000
IEEE
In this paper, we propose new scheduling algorithms to achieve fault security in multiprocessor systems. We consider scheduling of parallel programs represented by directed acycli...
102
click to vote
ESOP
2010
Springer
15 years 11 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
116
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...