3758 search results - page 55 / 752 » A Complete Subsumption Algorithm |
89
Voted
KBSE
2009
IEEE
15 years 7 months ago
2009
IEEE
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
101
Voted
PAMI
2007
15 years 3 days ago
2007
—This paper presents a new framework for the completion of missing information based on local structures. It poses the task of completion as a global optimization problem with a ...
SIGSOFT
2009
ACM
16 years 1 months ago
2009
ACM
The suggestions made by current IDE's code completion features are based exclusively on static type system of the programming language. As a result, often proposals are made ...
108
click to vote
TOPNOC
2008
15 years 15 days ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
208
Voted
VLDB
2003
ACM
16 years 25 days ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...