297 search results - page 31 / 60 » Towards a Parallel Search for Solutions of Non-deterministic... |
PVLDB
2008
13 years 8 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
GRID
2006
Springer
13 years 8 months ago
2006
Springer
Grids are intended to enable cross-organizational interactions which makes Grid security a challenging and nontrivial issue. In Grids, delegation is a key facility that can be used...
CCO
2001
Springer
14 years 29 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
PDP
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract—This paper proposes a strategy to organize metricspace query processing in multi-core search nodes as understood in the context of search engines running on clusters of ...