Sciweavers

322 search results - page 10 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
WSC
2000
13 years 10 months ago
Low cost response surface methods for and from simulation optimization
We propose "low cost response surface methods" (LCRSM) that typically require half the experimental runs of standard response surface methods based on central composite ...
Theodore Allen, Liyang Yu
VLDB
1999
ACM
87views Database» more  VLDB 1999»
14 years 25 days ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 23 days ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
JACM
2010
135views more  JACM 2010»
13 years 7 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
CEC
2009
IEEE
14 years 3 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben