1297 search results - page 5 / 260 » fews 2007 |
120
click to vote
STOC
2007
ACM
16 years 1 days ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
COMPSAC
2007
IEEE
15 years 6 months ago
2007
IEEE
Uncertainty analysis through sensitivity studies and quantification of the variance of the reliability estimate has become more common in architecture-based software reliability ...
122
click to vote
ISCC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Interactive and other delay-sensitive applications are interested in keeping end-to-end delays of their packets minimal. Unfortunately, congestion control offered by Tr...
119
click to vote
COMGEO
2007
ACM
14 years 11 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...