1529 search results - page 106 / 306 » Search Space Analysis of the Linear Ordering Problem |
160
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
109
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
148
click to vote
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
119
click to vote
COR
2010
15 years 4 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
143
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...