2944 search results - page 466 / 589 » Improving Bound Propagation |
166
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
168
click to vote
NSDI
2004
15 years 7 months ago
2004
This paper describes the design, implementation, and experimental evaluation of OverQoS, an overlay-based architecture for enhancing the best-effort service of today's Intern...
176
click to vote
OPODIS
2003
15 years 7 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
190
click to vote
COMGEO
2010
ACM
15 years 6 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...