2612 search results - page 272 / 523 » Assemblies as Graph Processes |
177
click to vote
CIKM
2005
Springer
16 years 5 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
184
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
191
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
161
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
This work addresses the issue of design optimization for faulttolerant hard real-time systems. In particular, our focus is on the handling of transient faults using both checkpoin...
152
click to vote
BTW
2001
Springer
15 years 11 months ago
2001
Springer
In this article, we present our efforts1 on realizing transformation independence in open, extensible, and highly distributed multimedia information The main focus is on the abstra...