5889 search results - page 970 / 1178 » Graph Layout Problems |
119
Voted
FMSD
2008
15 years 2 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
105
click to vote
CC
2006
Springer
15 years 2 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
113
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
116
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...