Sciweavers

4007 search results - page 674 / 802
» Computation with imprecise probabilities
Sort
View
CIMCA
2008
IEEE
14 years 4 months ago
Tree Exploration for Bayesian RL Exploration
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
Christos Dimitrakakis
ICC
2011
IEEE
185views Communications» more  ICC 2011»
12 years 9 months ago
An Information-Theoretic Approach to Accelerated Simulation of Hybrid-ARQ Systems
—In order to reduce the long runtimes required to simulate hybrid automatic repeat-request (ARQ) systems, such as high-speed downlink packet access (HSDPA), we propose an informa...
Matthew C. Valenti
ISPD
2012
ACM
252views Hardware» more  ISPD 2012»
12 years 5 months ago
Towards layout-friendly high-level synthesis
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...
TON
2012
12 years 16 days ago
Opportunistic Spectrum Access in Multiple-Primary-User Environments Under the Packet Collision Constraint
—Cognitive Radio (CR) technology has great potential to alleviate spectrum scarcity in wireless communications. It allows secondary users (SUs) to opportunistically access spectr...
Eric Jung, Xin Liu
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
12 years 16 days ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri