2292 search results - page 133 / 459 » Hierarchical approximation and localization |
134
click to vote
CONIELECOMP
2005
IEEE
15 years 10 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
IOR
2007
15 years 4 months ago
2007
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
140
click to vote
IJKESDP
2010
15 years 3 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
158
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
155
Voted
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...