1171 search results - page 164 / 235 » Variable neighborhood search |
143
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
105
click to vote
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
116
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
126
click to vote
CPC
1999
15 years 29 days ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
118
click to vote
EUROCAST
2007
Springer
15 years 5 months ago
2007
Springer
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...