728 search results - page 69 / 146 » Efficient Searching with Linear Constraints |
145
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Genetic Algorithm (GA) is known as a potent multiobjective optimization method, and the effectiveness of hybridizing it with local search (LS) has recently been reported in the li...
156
Voted
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
152
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
190
click to vote
JMLR
2008
15 years 6 months ago
2008
Pointwise consistent, feasible procedures for estimating contemporaneous linear causal structure from time series data have been developed using multiple conditional independence ...
171
click to vote
SIAMCOMP
2002
15 years 5 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...