9572 search results - page 256 / 1915 » Cover Algorithms and Their Combination |
208
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
149
click to vote
IMECS
2007
15 years 8 months ago
2007
—In this research, the Genetic Algorithm (GA) and Space-Filling Curve (SFC) are combined along with the use of Taguchi method for finding the optimal combination of parameters. T...
165
click to vote
CSCLP
2005
Springer
16 years 2 days ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
175
click to vote
ICALP
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
173
click to vote
WIDM
2003
ACM
15 years 11 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...