2485 search results - page 101 / 497 » Time Bounded Frequency Computations |
117
click to vote
ICPADS
2006
IEEE
15 years 10 months ago
2006
IEEE
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing pr...
157
click to vote
TON
2010
15 years 3 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
184
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
154
Voted
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
160
click to vote
AAAI
1996
15 years 6 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...