6167 search results - page 93 / 1234 » Can Refinement be Automated |
137
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
121
click to vote
KBSE
2008
IEEE
15 years 10 months ago
2008
IEEE
Developers undertaking a pragmatic reuse task must collect and reason about information that is spread throughout the source code of a system before they can understand the scope ...
121
click to vote
ADG
2004
Springer
15 years 9 months ago
2004
Springer
Construction of geometrical objects by origami, the Japanese traditional art of paper folding, is enjoyable and intriguing. It attracted the minds of artists, mathematicians and co...
142
click to vote
FIW
1994
15 years 5 months ago
1994
The feature interaction problem occurs when the addition of a new feature to a system disrupts the existing services and features. This paper describes a tabular notation for spec...
147
click to vote
INLG
2010
Springer
15 years 2 months ago
2010
Springer
Today there exist a growing number of framenet-like resources offering semantic and syntactic phrase specifications that can be exploited by natural language generation systems. I...