2040 search results - page 400 / 408 » On the Complexity of Error Explanation |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— For many tasks in populated environments, robots need to keep track of present and future motion states of people. Most approaches to people tracking make weak assumpti...
JSS
2010
13 years 6 months ago
2010
There is a general consensus on the importance of good Requirements Engineering (RE) for achieving high quality software. The modeling and analysis of requirements have been the m...
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Domain-specific languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...
RV
2010
Springer
13 years 6 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...