93
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
92
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
69
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
106
click to vote
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We introduce distributed games over asynchronous transition systems to model a distributed controller synthesis problem. A game involves two teams and is not turn-based: ...
121
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
103
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
118
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
85
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
102
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
100
Voted
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...