Sciweavers

9842 search results - page 386 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
FGCS
2007
106views more  FGCS 2007»
15 years 4 months ago
A parallel hybrid genetic algorithm for protein structure prediction on the computational grid
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
JMLR
2010
144views more  JMLR 2010»
14 years 11 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
INFOCOM
2012
IEEE
13 years 6 months ago
Jointly optimal bit loading, channel pairing and power allocation for multi-channel relaying
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
Mahdi Hajiaghayi, Min Dong, Ben Liang
INFOCOM
2012
IEEE
13 years 6 months ago
Maximizing system throughput by cooperative sensing in Cognitive Radio Networks
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...
Shuang Li, Zizhan Zheng, Eylem Ekici, Ness B. Shro...
IJRR
2008
139views more  IJRR 2008»
15 years 4 months ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal