5326 search results - page 221 / 1066 » On what we can ensure |
191
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
145
click to vote
ACL
2003
15 years 8 months ago
2003
In this paper we propose a competition learning approach to coreference resolution. Traditionally, supervised machine learning approaches adopt the singlecandidate model. Neverthe...
221
click to vote
WOODPECKER
2001
15 years 8 months ago
2001
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...
210
click to vote
RIVF
2003
15 years 8 months ago
2003
Abstract— This paper presents our work on supporting flexible query evaluation over large distributed, heterogeneous, and autonomous sources. Flexibility means that the query ev...
177
click to vote
AAAI
1998
15 years 8 months ago
1998
In abductive planning, plans are constructed as reasons for an agent to act: plans are demonstrations in logical theory of action that a goal will result assuming that given actio...