Sciweavers

791 search results - page 49 / 159
» Approximating the Maximum Sharing Problem
Sort
View
JAIR
2011
187views more  JAIR 2011»
13 years 2 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...
CSDA
2010
132views more  CSDA 2010»
13 years 7 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
WCNC
2008
IEEE
14 years 2 months ago
Estimation of Interference-Free Transmit Power for Opportunistic Spectrum Access
Abstract— We consider a scenario in which frequency agile radios opportunistically share a fixed spectrum resource with a set of primary nodes. We develop a collaborative scheme...
Brian L. Mark, Ahmed O. Nasif
INFOCOM
2003
IEEE
14 years 29 days ago
Time-Optimal Network Queue Control: The Case of a Single Congested Node
-We solve the problem of time-optimal network queue control: what are the input data rates that make network queue sizes converge to their ideal size in the least possible time aft...
Mahadevan Iyer, Wei Kang Tsai
MOBIHOC
2009
ACM
14 years 8 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar