973 search results - page 123 / 195 » New Bounds on Crossing Numbers |
152
click to vote
SAS
1991
Springer
15 years 9 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
179
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
121
click to vote
NIPS
2004
15 years 7 months ago
2004
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
158
click to vote
WSS
2001
15 years 7 months ago
2001
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabiliz...
153
click to vote
AAAI
1996
15 years 7 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...