3204 search results - page 541 / 641 » The Alcuin Number of a Graph |
176
click to vote
DM
2007
15 years 6 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
158
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
178
click to vote
JUCS
2006
15 years 6 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
173
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
151
click to vote
IPL
2007
15 years 6 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...