1738 search results - page 50 / 348 » Local Consistency and SAT-Solvers |
170
click to vote
ATVA
2004
Springer
15 years 11 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...
168
click to vote
ICRA
2002
IEEE
15 years 10 months 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...
139
click to vote
TSD
2001
Springer
15 years 10 months 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...
151
click to vote
APPROX
2006
Springer
15 years 9 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...
158
click to vote
AAAI
2008
15 years 8 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...