11129 search results - page 316 / 2226 » Modeling Search Computing Applications |
175
click to vote
AAAI
1994
15 years 8 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
187
click to vote
HYBRID
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
192
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Entering search terms on mobile phones is a time consuming and cumbersome task. In this paper, we explore the usage patterns of query entry interfaces that display suggestions. Ou...
160
click to vote
ICDCSW
2006
IEEE
16 years 23 days ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
189
click to vote
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...