1709 search results - page 68 / 342 » Comparing the Performance of Database Selection Algorithms |
114
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—While scalarization approaches to multicriteria optimization become infeasible in the case of many objectives, for few objectives the benefits of populationbased method...
88
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
223
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
Although conventional database management systems are designed to tolerate hardware and to a lesser extent even software errors, they cannot protect themselves against syntactical...
202
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
132
Voted
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper compares the performance of classification and regression trees (CART), multivariate adaptive regression splines (MARS), and a Gaussian mixture regressor (GMR) method ...