Sciweavers

929 search results - page 60 / 186
» heuristics 2008
Sort
View
CACM
2000
97views more  CACM 2000»
13 years 7 months ago
Generalizing by Removing Detail
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...
Kenneth M. Kahn
JGO
2010
138views more  JGO 2010»
13 years 6 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
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. ...
COMCOM
1998
102views more  COMCOM 1998»
13 years 7 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
CSC
2008
13 years 9 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- 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...
Qi Yang, Jamie McPeek, Adam Nofsinger
COLING
2008
13 years 9 months ago
Using Web-Search Results to Measure Word-Group Similarity
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...
Ann Gledson, John Keane