2584 search results - page 118 / 517 » On the Forward Checking Algorithm |
157
click to vote
SASN
2006
ACM
16 years 10 days ago
2006
ACM
This paper focuses on defending against compromised nodes’ dropping of legitimate reports and investigates the misbehavior of a maliciously packet-dropping node in sensor networ...
183
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
160
click to vote
CPM
1993
Springer
15 years 10 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
144
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
154
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...