1738 search results - page 50 / 348 » Local Consistency and SAT-Solvers |
ATVA
2004
Springer
14 years 1 months ago
2004
Springer
Data races do not cover all kinds of concurrency errors. This paper presents a data- ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
ICRA
2002
IEEE
14 years 17 days ago
2002
IEEE
We present a simple artificial landmark model and a robust tracking algorithm for the navigation of indoor mobile robots. The landmark model is designed to have a three-dimensiona...
TSD
2001
Springer
14 years 1 days ago
2001
Springer
The problem of automatic text segmentation is subcategorized into two different problems: thematic segmentation into rather large topically selfcontained sections and splitting int...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
AAAI
2008
13 years 10 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...