902 search results - page 74 / 181 » Efficient and Extensible Algorithms for Multi Query Optimiza... |
136
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
105
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
102
click to vote
AIIDE
2008
15 years 4 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
134
Voted
ARITH
2001
IEEE
15 years 6 months ago
2001
IEEE
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...
198
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...