Sciweavers

435 search results - page 17 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
109
Voted
ICIP
2007
IEEE
15 years 4 months ago
Adaptive Cluster-Distance Bounding for Nearest Neighbor Search in Image Databases
We consider approaches for exact similarity search in a high dimensional space of correlated features representing image datasets, based on principles of clustering and vector qua...
Sharadh Ramaswamy, Kenneth Rose
ICASSP
2011
IEEE
14 years 1 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
IJCAI
2001
14 years 11 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean
TEC
2002
163views more  TEC 2002»
14 years 9 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
84
Voted
CAV
2005
Springer
86views Hardware» more  CAV 2005»
15 years 3 months ago
Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...
Eric Vecchié, Robert de Simone