693 search results - page 64 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
139
click to vote
IEEEPACT
2007
IEEE
15 years 10 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
154
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
136
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The identification of patterns in biological sequences is a key challenge in genome analysis and in proteomics. Frequently such patterns are complex and highly variabl...
125
click to vote
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
354
click to vote
ICDE
2000
IEEE
16 years 5 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...