Sciweavers

8647 search results - page 19 / 1730
» The Container Selection Problem
Sort
View
DKE
2007
136views more  DKE 2007»
14 years 9 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
BNCOD
2006
55views Database» more  BNCOD 2006»
14 years 11 months ago
On the Optimal Ordering of Maps, Selections, and Joins Under Factorization
We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions i...
Thomas Neumann, Sven Helmer, Guido Moerkotte
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 3 months ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
CORR
2011
Springer
245views Education» more  CORR 2011»
14 years 4 months ago
Joint Distributed Access Point Selection and Power Allocation in Cognitive Radio Networks
Spectrum management has been identified as a crucial step towards enabling the technology of the cognitive radio network (CRN). Most of the current works dealing with spectrum ma...
Mingyi Hong, Alfredo Garcia, Jorge Alviar
STACS
2001
Springer
15 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid