180 search results - page 35 / 36 » Pruning the Search Space in Path-Based Test Generation |
114
click to vote
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
15 years 1 months ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
100
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
100
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
TREC
2003
14 years 11 months ago
2003
Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on...
SIAMIS
2010
14 years 8 months ago
2010
Surface registration, which transforms different sets of surface data into one common reference space, is an important process which allows us to compare or integrate the surface ...