Sciweavers

3341 search results - page 575 / 669
» On Bounded Queries and Approximation
Sort
View
JAIR
2010
145views more  JAIR 2010»
14 years 8 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JPDC
2010
106views more  JPDC 2010»
14 years 8 months ago
Feedback-directed page placement for ccNUMA via hardware-generated memory traces
Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of mul...
Jaydeep Marathe, Vivek Thakkar, Frank Mueller
TAMC
2010
Springer
14 years 8 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics
TCOM
2010
167views more  TCOM 2010»
14 years 8 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
TCOM
2010
80views more  TCOM 2010»
14 years 8 months ago
A Relay Assisted Cooperative Transmission Protocol for Wireless Multiple Access Systems
Abstract—In this paper, we propose a spectrally efficient cooperative transmission protocol for multiple access scenarios. The key feature is to utilize multi-user diversity and...
Zhiguo Ding, Kin K. Leung, Dennis Goeckel, Donald ...