2322 search results - page 245 / 465 » On a game in directed graphs |
195
click to vote
ISSTA
2009
ACM
16 years 1 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
177
click to vote
VLDB
2005
ACM
16 years 7 hour ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
181
click to vote
AIPS
2010
15 years 8 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
191
click to vote
COMCOM
2006
15 years 6 months ago
2006
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...