Sciweavers

2584 search results - page 118 / 517
» On the Forward Checking Algorithm
Sort
View
SASN
2006
ACM
14 years 2 months ago
A resilient packet-forwarding scheme against maliciously packet-dropping nodes in sensor networks
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...
Suk-Bok Lee, Yoon-Hwa Choi
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 12 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
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...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
14 years 6 days ago
Detecting False Matches in String Matching Algorithms
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 ...
S. Muthukrishnan
ICALP
1997
Springer
14 years 7 days ago
Constructive Linear Time Algorithms for Branchwidth
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....
Hans L. Bodlaender, Dimitrios M. Thilikos
CP
2004
Springer
13 years 12 months ago
A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint
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...
Willem Jan van Hoeve