394 search results - page 77 / 79 » Computing Minimal Polynomials of Matrices |
107
Voted
STOC
2002
ACM
16 years 21 days ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
102
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
94
Voted
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
104
click to vote
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
107
Voted
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...