1002 search results - page 131 / 201 » Towards Graph Programs for Graph Algorithms |
112
click to vote
ICDCSW
2008
IEEE
15 years 9 months ago
2008
IEEE
Research on delay tolerant networks (DTNs) has brought about a plethora of routing algorithms targeted at networks with different mobility patterns. However, few research works ha...
149
click to vote
PASTE
2010
ACM
15 years 7 months ago
2010
ACM
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
107
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
132
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
129
click to vote
EUROCAST
2007
Springer
15 years 6 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...