Sciweavers

3049 search results - page 262 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
EUROPAR
2006
Springer
15 years 10 months ago
On-Line Adaptive Parallel Prefix Computation
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Jean-Louis Roch, Daouda Traoré, Julien Bern...
APWEB
2006
Springer
15 years 10 months ago
Energy-Efficient Deployment of Mobile Sensor Networks by PSO
Abstract. Sensor deployment is an important issue in designing sensor networks. In this paper, particle swarm optimization (PSO) approach is applied to maximize the coverage based ...
Xiaoling Wu, Shu Lei, Jin Wang, Jinsung Cho, Sungy...
ICASSP
2009
IEEE
16 years 1 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
COMGEO
2008
ACM
15 years 6 months ago
Optimal core-sets for balls
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...
Mihai Badoiu, Kenneth L. Clarkson
JMLR
2006
117views more  JMLR 2006»
15 years 6 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon