1941 search results - page 154 / 389 » On the Hardness of Approximate Reasoning |
182
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
205
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
162
click to vote
ICLP
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
169
click to vote
FM
2005
Springer
16 years 1 days ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
178
click to vote
ICCBR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The definition of similarity measures is one of the most crucial aspects when developing case-based applications. In particular, when employing similarity measures that ...