Sciweavers

2089 search results - page 164 / 418
» A New Problem in String Searching
Sort
View
CEC
2005
IEEE
15 years 4 months ago
Rank and proximity based crossover (RPC) to improve convergence in genetic search
A new crossover technique, we named Rank and Proximity Based Crossover (RPC), to improve the speed and quality of solutions in Genetic search, is proposed. In the proposed strategy...
Goutam Chakraborty, Basabi Chakraborty
IJCAI
1997
15 years 4 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
AAAI
2006
15 years 4 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
101
Voted
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 3 months ago
Profile Based Sub-Image Search in Image Databases
Sub-image search with high accuracy in natural images still remains a challenging problem. This paper proposes a new feature vector called profile for a keypoint in a bag of visual...
Vishwakarma Singh, Ambuj K. Singh
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 5 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray