491 search results - page 79 / 99 » Ranking Abstractions |
ERCIMDL
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We present an approach to increasing the effectiveness of rankedoutput retrieval systems that relies on graphical display and user manipulation of “views” of retrieva...
CONCUR
2007
Springer
14 years 21 days ago
2007
Springer
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
EPIA
2009
Springer
14 years 19 days ago
2009
Springer
Abstract. Robots need to ground their external vocabulary and internal symbols in observations of the world. In recent works, this problem has been approached through combinations ...
CONCUR
2006
Springer
14 years 15 days ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
CP
2006
Springer
14 years 15 days ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...