6004 search results - page 402 / 1201 » Parallelizing query optimization |
252
click to vote
SSD
2007
Springer
16 years 29 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
170
Voted
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
174
Voted
PPSN
2004
Springer
16 years 6 days ago
2004
Springer
Formula One motor racing is a rich sport that spends millions on research and development of highly optimized cars. Here we describe the use of a genetic algorithm to optimize 66 s...
201
Voted
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
171
Voted
IEEEPACT
2005
IEEE
16 years 14 days ago
2005
IEEE
Dynamic optimization has the potential to adapt the program’s behavior at run-time to deliver performance improvements over static optimization. Dynamic optimization systems usu...