292 search results - page 54 / 59 » Are Stable Instances Easy |
110
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
106
click to vote
PLDI
1996
ACM
15 years 4 months ago
1996
ACM
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
133
Voted
ARGMAS
2007
Springer
15 years 4 months ago
2007
Springer
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
109
click to vote
CEAS
2006
Springer
15 years 4 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
117
Voted
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...