693 search results - page 46 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
119
click to vote
DASFAA
2008
IEEE
15 years 5 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
104
click to vote
JSA
2006
15 years 3 months ago
2006
ct 7 Social animals or insects in nature often exhibit a form of emergent collective behavior known as flocking. In this paper, 8 we present a novel Flocking based approach for doc...
128
Voted
BMCBI
2006
15 years 4 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
165
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
177
Voted
TEC
2002
15 years 3 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...