Sciweavers

1461 search results - page 141 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
IAT
2010
IEEE
15 years 4 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
COR
2011
15 years 1 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
ICASSP
2011
IEEE
14 years 10 months ago
Reduced complexity blind deterministic frequency offset estimation in OFDM systems
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
Hyoung-Goo Jeon, Kyoung-Soo Kim, Erchin Serpedin
HM
2007
Springer
137views Optimization» more  HM 2007»
16 years 18 days ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 6 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...