Sciweavers

2194 search results - page 61 / 439
» Improving HLRTA*( k )
Sort
View
CEC
2011
IEEE
13 years 11 months ago
Simple adaptive cognition for PSO
Abstract—A simple, effective, computationally cheap, and easily tuned method is presented for improving PSO performance by automatically adapting acceleration coefficients. Whil...
Christopher K. Monson
JSAC
2008
106views more  JSAC 2008»
14 years 11 months ago
Enhanced multiuser random beamforming: dealing with the not so large number of users case
We consider the downlink of a wireless system with an M-antenna base station and K single-antenna users. A limited feedback-based scheduling and precoding scenario is considered th...
Marios Kountouris, David Gesbert, Thomas Sälz...
IPL
2007
76views more  IPL 2007»
14 years 11 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
EMNLP
2010
14 years 10 months ago
Uptraining for Accurate Deterministic Question Parsing
It is well known that parsing accuracies drop significantly on out-of-domain data. What is less known is that some parsers suffer more from domain shifts than others. We show that...
Slav Petrov, Pi-Chuan Chang, Michael Ringgaard, Hi...
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 2 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...