Sciweavers

4843 search results - page 217 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 9 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
133
Voted
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 10 months ago
Adaptive bases for Q-learning
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
Dotan Di Castro, Shie Mannor
SIAMNUM
2010
103views more  SIAMNUM 2010»
14 years 10 months ago
Hybridization and Postprocessing Techniques for Mixed Eigenfunctions
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
Bernardo Cockburn, Jayadeep Gopalakrishnan, F. Li,...
166
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Maximizing capacity with power control under physical interference model in duplex mode
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, ...
JCB
2007
168views more  JCB 2007»
15 years 3 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang