6004 search results - page 381 / 1201 » Parallelizing query optimization |
204
click to vote
IIS
2003
15 years 8 months ago
2003
Abstract. The problem of parallel and distributed function optimization with coevolutionary algorithms is considered. Two coevolutionary algorithms are used for this purpose and co...
162
click to vote
EOR
2007
15 years 6 months ago
2007
Recent results have used game theory to explore the nature of optimal investments in the security of simple series and parallel systems. However, it is clearly important in practi...
155
click to vote
TROB
2008
15 years 6 months ago
2008
Abstract--In this paper, the authors examine the problem of designing nominal manipulator Jacobians that are optimally fault tolerant to one or more joint failures. Optimality is d...
199
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
216
click to vote
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...