963 search results - page 112 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
HM
2007
Springer
15 years 6 months ago
2007
Springer
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 ⊆...
111
click to vote
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
100
click to vote
JSAC
2008
14 years 12 months ago
2008
Abstract--We consider the design of multiple-input multipleoutput communication systems with a linear precoder at the transmitter, zero-forcing decision feedback equalization (ZFDF...
110
click to vote
ICDE
2011
IEEE
14 years 3 months ago
2011
IEEE
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
101
click to vote
GECCO
2008
Springer
15 years 29 days ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...