A long-standing goal of the programming by demonstration research community is to enable people to construct programs by showing how the desired programs should work on sample inp...
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Semantic relatedness between words is important to many NLP tasks, and numerous measures exist which use a variety of resources. Thus far, such work is confined to measuring simil...