Sciweavers

13987 search results - page 48 / 2798
» The Two Guards Problem
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
15 years 28 days ago
Speed-up techniques for solving large-scale bTSP with the Two-Phase Pareto Local Search
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
Thibaut Lust
IDEAS
2007
IEEE
118views Database» more  IDEAS 2007»
15 years 6 months ago
A Two Layered Approach for Querying Integrated XML Sources
The problem of data integration (query decomposition, data fragmentation) has been widely studied in literature, but the inherent hierarchical nature of XML data presents problems...
Felipe Victolla Silveira, Carlos A. Heuser
ISAAC
2004
Springer
114views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
RNA is generally a single-stranded molecule where the bases form hydrogen bonds within the same molecule leading to structure formation. In comparing different homologous RNA mole...
Markus Bauer, Gunnar W. Klau
INFOCOM
2011
IEEE
14 years 3 months ago
Opportunistic spectrum access for mobile cognitive radios
—Cognitive radios (CRs) can mitigate the impending spectrum scarcity problem by utilizing their capability of accessing licensed spectrum bands opportunistically. While most exis...
Alexander W. Min, Kyu-Han Kim, Jatinder Pal Singh,...
CCCG
2008
15 years 1 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...